A logical analysis of modules in logic programming

DOI10.1016/0743-1066(89)90031-9MaRDI QIDQ4730754zbMATH OpenOpenAlexFDO

Authors

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

logic programmingmodel theoryPrologproof theory

Mathematics Subject Classification ID

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

Recommendations

• Structuring logic programs: a modal approach
• A calculus for the construction of modular prolog programs
• scientific article; zbMATH DE number 1200168
• A modal extension of logic programming: modularity, beliefs and hypothetical reasoning
• Extending Horn clause logic with implication goals

Cited in

(36)

• Extending Horn clause logic with implication goals
• Compositional model-theoretic semantics for logic programs
• Representing scope in intuitionistic deductions
• A semantics for modular general logic programs
• Implementing specifications by dynamic inheritance
• An abstract interpretation framework for optimizing dynamic modular logic languages
• Institutions for logic programming
• A new framework for declarative programming
• Proof-search in type-theoretic languages: An introduction
• Uniform proofs as a foundation for logic programming
• Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
• Enumeration operators and modular logic programming
• Clausal intuitionistic logic I. fixed-point semantics
• scientific article; zbMATH DE number 86272 (Why is no real title available?)
• The Logic of Bunched Implications
• scientific article; zbMATH DE number 2012389 (Why is no real title available?)
• Semantics of structured normal logic programs
• scientific article; zbMATH DE number 1497834 (Why is no real title available?)
• First-order modular logic programs and their conservative extensions
• Extensions to logic programming motivated by the construction of a generic theorem prover
• A refinement of import/export declarations in modular logic programming and its semantics
• Algebraic methods in the compositional analysis of logic programs
• In praise of impredicativity: a contribution to the formalization of meta-programming
• Modules and specifications
• Modularity and relevant logic
• A Survey of the Proof-Theoretic Foundations of Logic Programming
• Definite Formulae, Negation-as-Failure, and the Base-Extension Semantics of Intuitionistic Propositional Logic
• Reductive logic, proof-search, and coalgebra: a perspective from resource semantics
• Focusing Gentzen's LK proof system
• Forum: A multiple-conclusion specification logic
• Kripke semantics for higher-order type theory applied to constraint logic programming languages
• Defining logical systems via algebraic constraints on proofs
• Proof-theoretic semantics for intuitionistic multiplicative linear logic
• From proof-theoretic validity to base-extension semantics for intuitionistic propositional logic
• Equilibrium logic
• Translating propositional extended conjunctions of Horn clauses into Boolean circuits

This page was built for publication: A logical analysis of modules in logic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4730754)