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

proof theorymodel theorylogic programmingProlog

Mathematics Subject Classification ID

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

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

(32)

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

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)