N-Prolog: An extension of Prolog with hypothetical implications. I.
From MaRDI portal
Publication:3696485
DOI10.1016/0743-1066(84)90029-3zbMath0576.68001OpenAlexW2084749326MaRDI QIDQ3696485
Publication date: 1984
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0743-1066(84)90029-3
Related Items
The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics, MOLOG: A system that extends PROLOG with modal logic, TMPR: A tree-structured modified problem reduction proof procedure and its extension to three-valued logic, An overview of transaction logic, Computation with run time skolemisation (N-Prolog part 3), Uniform proofs as a foundation for logic programming, Near-Horn Prolog and the ancestry family of procedures, Programming in metric temporal logic, Direct deductive computation on discourse representation structures, Hypothetical updates, priority and inconsistency in a logic programming language, A Survey of the Proof-Theoretic Foundations of Logic Programming, Semantics of structured normal logic programs, Hypothetical datalog: Complexity and expressibility, Hypothetical reasoning in logic programming: A semantic approach, Best unifiers in transitive modal logics, An abductive proof procedure for conditional logic programming, Relevant logic programming, Extending Horn clause logic with implication goals, Kripke semantics for higher-order type theory applied to constraint logic programming languages, Foundations of semantic web databases, Logical modes of attack in argumentation networks, On the effectiveness of higher-order logic programming in language-oriented programming, CWA Extensions to Multi-Valued Logics
Uses Software
