Clausal intuitionistic logic I. fixed-point semantics

DOI10.1016/0743-1066(88)90005-2MaRDI QIDQ3787973zbMATH OpenOpenAlexFDO

Authors L. Thorne McCarty

Publication date 1988

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

Full work available at URL https://doi.org/10.1016/0743-1066(88)90005-2

zbMATH Keywords

intuitionistic logicintuitionistic semanticsfixed point semanticsextension of Horn clause logicmodel intersection property

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Mechanization of proofs and logical operations (03B35)

Recommendations

• A logical analysis of modules in logic programming
• Translating propositional extended conjunctions of Horn clauses into Boolean circuits
• Circumscribing embedded implications (without stratifications)
• Modelling the combination of functional and logic programming languages
• scientific article; zbMATH DE number 4205998
• A Proof-Theoretic Approach to Logic Programming. I. Clauses as Rules
• Mathematical Foundations of Computer Science 2005
• Extensions of logic programming. International workshop, Tübingen, FRG, 8--10 December 1989. Proceedings
• Relevant logic programming
• HORNLOG: A graph-based interpreter for general Horn clauses

Cited in

(23)

• Programming in three-valued logic
• Clausal intuitionistic logic II. tableau proof procedures
• CIFOL: case-intensional first order logic. I: Toward a theory of sorts
• The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics
• Hypothetical updates, priority and inconsistency in a logic programming language
• Equilibrium logic
• Clausal relations and {C}-clones
• Programming in metric temporal logic
• Semantics of structured normal logic programs
• Agenda control for heterogeneous reasoners
• Reasoning about nonlinear system identification
• Intuitionistic interpretation of deductive databases with incomplete information
• scientific article; zbMATH DE number 4137744 (Why is no real title available?)
• Extending Horn clause logic with implication goals
• Logic Programming
• Hypothetical datalog: Complexity and expressibility
• Hypothetical reasoning in logic programming: A semantic approach
• scientific article; zbMATH DE number 3930328 (Why is no real title available?)
• An abstract interpretation framework for optimizing dynamic modular logic languages
• scientific article; zbMATH DE number 1341468 (Why is no real title available?)
• The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
• Fixpoint semantics for logic programming a survey
• A Survey of the Proof-Theoretic Foundations of Logic Programming

This page was built for publication: Clausal intuitionistic logic I. fixed-point semantics

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