N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure
From MaRDI portal
Publication:3727349
DOI10.1016/S0743-1066(85)80003-0zbMath0595.68004MaRDI QIDQ3727349
Publication date: 1985
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01)
Related Items
TMPR: A tree-structured modified problem reduction proof procedure and its extension to three-valued logic, Computation with run time skolemisation (N-Prolog part 3), Near-Horn Prolog and the ancestry family of procedures, 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, An extended constraint deductive database: theory and implementation, Semantics of structured normal logic programs, Hypothetical datalog: Complexity and expressibility, A family of goal directed theorem provers based on conjunction and implication. I, Extending Horn clause logic with implication goals, Knowledgebase transformations, Theory of semi-instantiation in abstract argumentation, Translating propositional extended conjunctions of Horn clauses into Boolean circuits, Model elimination without contrapositives, Correspondences between classical, intuitionistic and uniform provability, What Is Negation in a System 2020?
