MOLOG: A system that extends PROLOG with modal logic
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4066840
- scientific article; zbMATH DE number 92602
- Decidability by resolution for propositional modal logics
- On two approaches to modal theorem proving
- Logic Programming
- Strategies for modal resolution: Results and problems
- Logics in Artificial Intelligence
- The recursive resolution method for modal logic
- Modal provability foundations for negation by failure
- scientific article; zbMATH DE number 4027426
Cites work
- scientific article; zbMATH DE number 3932427 (Why is no real title available?)
- scientific article; zbMATH DE number 3684922 (Why is no real title available?)
- scientific article; zbMATH DE number 3740789 (Why is no real title available?)
- scientific article; zbMATH DE number 43239 (Why is no real title available?)
- A simple deduction method for modal logic
- Modalities and Quantification
- N-Prolog: An extension of Prolog with hypothetical implications. I.
Cited in
(28)- Multi-dimensional logic programming: theoretical foundations
- Multi-modal logic programming using equational and order-sorted logic
- Strategies for modal resolution: Results and problems
- scientific article; zbMATH DE number 1761430 (Why is no real title available?)
- The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics
- scientific article; zbMATH DE number 4035208 (Why is no real title available?)
- Multimodal logic programming
- Proof methods for reasoning about possibility and necessity
- Programming in metric temporal logic
- An epistemic model of logic programming
- Multimodal logic programming using equational and order-sorted logic
- Tractable reasoning using logic programs with intensional concepts
- Logics in Artificial Intelligence
- Foundations of linear-time logic programming
- Resolution with order and selection for hybrid logics
- Modal logic programming revisited
- Logic Programming
- Many-valued modalities and paraconsistency
- Logic programming as classical inference
- Resolution for some first-order modal systems
- Game semantics for non-monotonic intensional logic programming
- Programming in temporal-nonmonotonic reasoning
- Reasoning about reasoning in a meta-level architecture
- Modal resolution in clausal form
- Temporal equilibrium logic with past operators
- CWA extensions to multi-valued logics
- The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
- An infinitary encoding of temporal equilibrium logic
This page was built for publication: MOLOG: A system that extends PROLOG with modal logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1079962)