From conventional to institution-independent logic programming

No abstract is available for this paper.

• Publication year

  2015

• Venue

  Journal of Logic and Computation

• Publication date

  2015-06-09

• Fields of study

  Philosophy, Computer Science

• Identifiers
  DOI 10.1093/logcom/exv021
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• ∞-Categories for the Working Mathematician

  2018cited by this paper
• Service-Oriented Logic Programming

  2015cited by this paper
• Forcing, Downward Löwenheim-Skolem and Omitting Types Theorems, Institutionally

  2013cited by this paper
• A Logic-Programming Semantics of Services

  2013cited by this paper
• Institution Morphisms

  2013cited by this paper
• Constructor-based Logics

  2012cited by this paper
• Foundations of Algebraic Specification and Formal Software Development

  2012influential reference
• An axiomatic approach to structuring specifications

  2012cited by this paper
• On the algebra of structured specifications

  2011cited by this paper
• Hybridization of Institutions

  2011cited by this paper
• Structural induction in institutions

  2011cited by this paper
• An abstract model of service discovery and binding

  2011cited by this paper
• Completeness by Forcing

  2010cited by this paper
• What is a Logic Translation?

  2009cited by this paper
• Birkhoff Completeness in Institutions

  2008cited by this paper
• Institutional 2-cells and Grothendieck Institutions

  2006cited by this paper
• Type Class Polymorphism in an Institutional Framework

  2004cited by this paper
• Herbrand theorems in arbitrary institutions

  2004influential reference
• Comorphism-Based Grothendieck Logics

  2002cited by this paper
• A hidden Herbrand theorem: combining the object and logic paradigms

  2002cited by this paper
• Logical systems for structured specifications

  2002cited by this paper
• Term rewriting and all that

  1998cited by this paper
• Towards Heterogeneous Specifications

  1998cited by this paper
• Completeness of category-based equational deduction

  1995cited by this paper
• Moving Between Logical Systems

  1995cited by this paper
• Logical support for modularisation

  1993cited by this paper
• Multiparadigm Logic Programming

  1992cited by this paper
• Institutions: abstract model theory for specification and programming

  1992influential reference
• Some Fundamental Algebraic Tools for the Semantics of Computation: Part 3: Indexed Categories

  1991cited by this paper
• Abstract and Concrete Categories - The Joy of Cats

  1990cited by this paper
• What Is Unification?: A Categorical View of Substitution, Equation and Solution

  1989cited by this paper
• Specifications in an Arbitrary Institution

  1988cited by this paper
• Algebraic Specifications of Reachable Higher-Order Algebras

  1988cited by this paper
• Models and Equality for Logical Programming

  1987cited by this paper
• Quasi-varieties in Abstract Algebraic Institutions

  1986cited by this paper
• EQLOG: Equality, Types, and Generic Modules For Logic Programming

  1986cited by this paper
• A Study in the Functions of Programming Methodology: Specifications, Institutions, Charters and Parchments

  1985cited by this paper
• The Semantics of Shared Submodules Specifications

  1985cited by this paper
• Some Fundamental Algebraic Tools for the Semantics of Computation. Part II: Signed and Abstract Theories

  1984cited by this paper
• Foundations of Logic Programming

  1984influential reference
• Some Fundamental Algebraic Tools for the Semantics of Computation. Part 1: Comma Categories, Colimits, Signatures and Theories

  1984cited by this paper
• Building Specifications in an Arbitrary Institution

  1984cited by this paper
• Paramodulation and Theorem-Proving in First-Order Theories with Equality

  1983cited by this paper
• Graduate Texts in Mathematics

  1982cited by this paper
• The Semantics of CLEAR, A Specification Language

  1979cited by this paper
• Predicate Logic as Programming Language

  1974cited by this paper
• Linear Resolution with Selection Function

  1971cited by this paper
• A Machine-Oriented Logic Based on the Resolution Principle

  1965cited by this paper

• Foundations of logic programming in hybrid-dynamic quantum logic

  2024cites this paper
• The Axiomatic Approach to Non-Classical Model Theory

  2022cites this paper
• Robinson consistency in many-sorted hybrid first-order logics

  2022cites this paper
• Omitting types theorem in hybrid dynamic first-order logic with rigid symbols

  2022cites this paper
• Forcing and Calculi for Hybrid Logics

  2020cites this paper
• Horn Clauses in Hybrid-Dynamic First-Order Logic

  2019cites this paper
• Term Charters

  2018cites this paper
• Foundations of logic programming in hybrid logics with user-defined sharing

  2017cites this paper
• Many-Valued Institutions for Constraint Specification

  2016cites this paper
• Service-Oriented Logic Programming

  2015cites this paper
• Hues of Satisfaction: Many-valued Institutions for Constraint Specification

  2015cites this paper
• Revisiting the Institutional Approach to Herbrand's Theorem

  2015cites this paper
• Foundations of Structured Specifications

  year unknowncites this paper