Near-Horn prolog and beyond
From MaRDI portal
Publication:757031
DOI10.1007/BF00249353zbMath0723.68029OpenAlexW1995908030MaRDI QIDQ757031
Publication date: 1991
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00249353
Related Items
TMPR: A tree-structured modified problem reduction proof procedure and its extension to three-valued logic, On computing minimal models, Near-Horn Prolog and the ancestry family of procedures, Negation as failure for disjunctive logic programming, Non-Horn clause logic programming, Computing answers with model elimination, A family of goal directed theorem provers based on conjunction and implication. I, Parsing as non-Horn deduction, Model elimination without contrapositives, The applicability of logic program analysis and transformation to theorem proving, Lemma matching for a PTTP-based top-down theorem prover, Renaming a set of non-Horn clauses
