A logical analysis of modules in logic programming

DOI10.1016/0743-1066(89)90031-9zbMath0681.68022OpenAlexW2052436826MaRDI QIDQ4730754

No author found.

Publication date: 1989

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-1066(89)90031-9

zbMATH Keywords

model theoryproof theorylogic programmingProlog

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01) Theory of operating systems (68N25)

Related Items

The Logic of Bunched Implications, An abstract interpretation framework for optimizing dynamic modular logic languages, Uniform proofs as a foundation for logic programming, Equilibrium logic, Algebraic methods in the compositional analysis of logic programs, Institutions for logic programming, A Survey of the Proof-Theoretic Foundations of Logic Programming, A new framework for declarative programming, In Praise of Impredicativity: A Contribution to the Formalization of Meta-Programming, Definite Formulae, Negation-as-Failure, and the Base-Extension Semantics of Intuitionistic Propositional Logic, Semantics of structured normal logic programs, Unnamed Item, Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs, Extending Horn clause logic with implication goals, Forum: A multiple-conclusion specification logic, Kripke semantics for higher-order type theory applied to constraint logic programming languages, Compositional model-theoretic semantics for logic programs, Translating propositional extended conjunctions of Horn clauses into Boolean circuits, Representing scope in intuitionistic deductions, A semantics for modular general logic programs, Modules and specifications, Proof-search in type-theoretic languages: An introduction