Foundations of logic programming in hybrid logics with user-defined sharing
From MaRDI portal
Recommendations
- Foundations of Logic Programming in Hybridised Logics
- An algebraic approach to sharing analysis of logic programs
- A first-order language for expressing sharing and type properties of logic programs
- scientific article; zbMATH DE number 841929
- scientific article; zbMATH DE number 1531964
- scientific article; zbMATH DE number 3872640
- Theoretical Foundations and Semantics of Logic Programming
- Unifying theories for logic programming
- Hybrid logics and ontology languages
- Hybrid logic and its proof-theory
Cites work
- scientific article; zbMATH DE number 3869407 (Why is no real title available?)
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 3963900 (Why is no real title available?)
- scientific article; zbMATH DE number 4037182 (Why is no real title available?)
- scientific article; zbMATH DE number 1950252 (Why is no real title available?)
- scientific article; zbMATH DE number 1998330 (Why is no real title available?)
- scientific article; zbMATH DE number 2172803 (Why is no real title available?)
- scientific article; zbMATH DE number 3271460 (Why is no real title available?)
- 13 questions about universal logic. 13 questions to Jean-Yves Béziau by Linda Eastwood
- A hidden Herbrand theorem: Combining the object and logic paradigms
- An essay in combinatory dynamic logic
- Birkhoff completeness in institutions
- Bringing them all together
- CASL reference manual. The complete documentation of the common algebraic specification language.
- CASL: the Common Algebraic Specification Language.
- CafeOBJ Report. The language, proof techniques, and methodologies for object-oriented algebraicspecification
- Combinations and completeness transfer for quantified modal logics
- Completeness by forcing
- Constructor-based logics
- Elementary Diagrams in Institutions
- Encoding hybridized institutions into first-order logic
- Equality, types, modules, and (why not?) generics for logic programming
- Foundations of Logic Programming in Hybridised Logics
- Herbrand theorems in arbitrary institutions
- Hybrid logic and its proof-theory
- Hybridization of institutions
- Implicit Kripke semantics and ultraproducts in stratified institutions
- Initial semantics in logics with constructors
- Institution morphisms
- Institution-independent model theory
- Institutions: abstract model theory for specification and programming
- Logical foundations of CafeOBJ
- On the existence of free models in abstract algebraic institutions
- Quasi-varieties and initial semantics for hybridized institutions
- Quasi-varieties in abstract algebraic institutions
- Refinement in hybridised institutions
- Relating CASL with other specification languages: the institution level.
- Representation, reasoning, and relational structures: a hybrid logic manifesto
- Stratified institutions and elementary homomorphisms
- Universal logic: An anthology. From Paul Hertz to Dov Gabbay
Cited in
(7)- Stability of termination and sufficient-completeness under pushouts via amalgamation
- Omitting types theorem in hybrid dynamic first-order logic with rigid symbols
- Herbrand theorems in arbitrary institutions
- Many-sorted hybrid modal languages
- Birkhoff style calculi for hybrid logics
- Foundations of Logic Programming in Hybridised Logics
- Logics for actor networks: a two-stage constrained-hybridisation approach
This page was built for publication: Foundations of logic programming in hybrid logics with user-defined sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2358621)
