Clausal intuitionistic logic I. fixed-point semantics
DOI10.1016/0743-1066(88)90005-2zbMATH Open0645.03006OpenAlexW1986404405MaRDI QIDQ3787973FDOQ3787973
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
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
intuitionistic logicintuitionistic semanticsfixed point semanticsextension of Horn clause logicmodel intersection property
Subsystems of classical logic (including intuitionistic logic) (03B20) Mechanization of proofs and logical operations (03B35)
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
- Hypothetical updates, priority and inconsistency in a logic programming language
- The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics
- Equilibrium logic
- Clausal relations and {C}-clones
- Programming in metric temporal logic
- Semantics of structured normal logic programs
- Reasoning about nonlinear system identification
- Agenda control for heterogeneous reasoners
- Intuitionistic interpretation of deductive databases with incomplete information
- Title not available (Why is that?)
- Extending Horn clause logic with implication goals
- Logic Programming
- Title not available (Why is that?)
- Hypothetical datalog: Complexity and expressibility
- Hypothetical reasoning in logic programming: A semantic approach
- An abstract interpretation framework for optimizing dynamic modular logic languages
- Title not available (Why is that?)
- 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)
