Daniel Gâinâ

Publication Activity (10 Years)

Years Active: 2006-2019
Publications (10 Years): 6

Top Topics

Logic Programming

Transition Systems

Top Venues

Theor. Comput. Sci.

J. Log. Comput.

Publications

Daniel Gâinâ, Ionut Tutu
Horn Clauses in Hybrid-Dynamic First-Order Logic. CoRR (2019)
Daniel Gâinâ, Ionut Tutu
Birkhoff Completeness for Hybrid-Dynamic First-Order Logic. TABLEAUX (2019)
Daniel Gâinâ, Ionut Tutu, Adrián Riesco
Specification and Verification of Invariant Properties of Transition Systems. APSEC (2018)
Daniel Gâinâ
Downward Löwenheim-Skolem Theorem and interpolation in logics with constructors. J. Log. Comput. 27 (6) (2017)
Daniel Gâinâ
Birkhoff style calculi for hybrid logics. Formal Aspects Comput. 29 (5) (2017)
Daniel Gâinâ
Foundations of logic programming in hybrid logics with user-defined sharing. Theor. Comput. Sci. 686 (2017)
Masaki Nakamura, Daniel Gâinâ, Kazuhiro Ogata, Kokichi Futatsugi
Proving Sufficient Completeness of Constructor-Based Algebraic Specifications. CSA/CUTE (2015)
Daniel Gâinâ, Kokichi Futatsugi
Initial semantics in logics with constructors. J. Log. Comput. 25 (1) (2015)
Daniel Gâinâ, Dorel Lucanu, Kazuhiro Ogata, Kokichi Futatsugi
On Automation of OTS/CafeOBJ Method. Specification, Algebra, and Software (2014)
Daniel Gâinâ
Foundations of Logic Programming in Hybridised Logics. WADT (2014)
Daniel Gâinâ
Forcing, Downward Löwenheim-Skolem and Omitting Types Theorems, Institutionally. Logica Universalis 8 (3-4) (2014)
Daniel Gâinâ
Interpolation in logics with constructors. Theor. Comput. Sci. 474 (2013)
Daniel Gâinâ, Min Zhang, Yuki Chiba, Yasuhito Arimoto
Constructor-Based Inductive Theorem Prover. CALCO (2013)
Daniel Gâinâ, Kokichi Futatsugi, Kazuhiro Ogata
Constructor-based Logics. J. Univers. Comput. Sci. 18 (16) (2012)
Kokichi Futatsugi, Daniel Gâinâ, Kazuhiro Ogata
Principles of proof scores in CafeOBJ. Theor. Comput. Sci. 464 (2012)
Daniel Gâinâ, Marius Petria
Completeness by Forcing. J. Log. Comput. 20 (6) (2010)
Daniel Gâinâ, Kokichi Futatsugi, Kazuhiro Ogata
Constructor-Based Institutions. CALCO (2009)
Mihai Codescu, Daniel Gâinâ
Birkhoff Completeness in Institutions. Logica Universalis 2 (2) (2008)
Daniel Gâinâ, Andrei Popescu
An Institution-Independent Proof of the Robinson Consistency Theorem. Stud Logica 85 (1) (2007)
Daniel Gâinâ, Andrei Popescu
An Institution-independent Generalization of Tarski's Elementary Chain Theorem. J. Log. Comput. 16 (6) (2006)