Foundations of logic programming in hybrid logics with user-defined sharing

DOI10.1016/j.tcs.2017.04.009zbMath1371.68048OpenAlexW2608495573MaRDI QIDQ2358621

Daniel Găină

Publication date: 15 June 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.04.009

zbMATH Keywords

logic programmingHerbrand's theoreminstitutioninitiality

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17)

Related Items (5)

Birkhoff style calculi for hybrid logics ⋮ Logics for actor networks: a two-stage constrained-hybridisation approach ⋮ Stability of termination and sufficient-completeness under pushouts via amalgamation ⋮ Many-sorted hybrid modal languages ⋮ Omitting types theorem in hybrid dynamic first-order logic with rigid symbols

Uses Software

• CASL
• CafeOBJ

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Institution morphisms
• Universal logic: An anthology. From Paul Hertz to Dov Gabbay
• An essay in combinatory dynamic logic
• Birkhoff completeness in institutions
• On the existence of free models in abstract algebraic institutions
• Quasi-varieties in abstract algebraic institutions
• Logical foundations of CafeOBJ
• CASL: the Common Algebraic Specification Language.
• Relating CASL with other specification languages: the institution level.
• A hidden Herbrand theorem: Combining the object and logic paradigms
• CASL reference manual. The complete documentation of the common algebraic specification language.
• Refinement in hybridised institutions
• Stratified institutions and elementary homomorphisms
• Herbrand theorems in arbitrary institutions
• Institution-independent model theory
• Bringing them all Together
• Foundations of Logic Programming in Hybridised Logics
• Quasi-varieties and initial semantics for hybridized institutions
• Completeness by Forcing
• Hybridization of Institutions
• Combinations and completeness transfer for quantified modal logics
• Implicit Kripke semantics and ultraproducts in stratified institutions
• Institutions: abstract model theory for specification and programming
• Representation, reasoning, and relational structures: a hybrid logic manifesto
• Elementary Diagrams in Institutions
• Initial semantics in logics with constructors
• Encoding hybridized institutions into first-order logic
• Equality, types, modules, and (why not?) generics for logic programming
• Hybrid logic and its proof-theory

This page was built for publication: Foundations of logic programming in hybrid logics with user-defined sharing