Making prolog more expressive

DOI10.1016/0743-1066(84)90011-6zbMath0584.68022OpenAlexW1985819576MaRDI QIDQ3707363

Rodney W. Topor, John W. Lloyd

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)90011-6

zbMATH Keywords

semanticslogic programmingfirst order logicmany-sorted predicate calculusHorn clause programdeductive database systemsresolution proof search tree

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) General topics in the theory of software (68N01)

Related Items (33)

Reactive computing as model generation ⋮ Computation of full logic programs using one-variable environments ⋮ Bounded quantifications for iteration and concurrency in logic programming ⋮ A necessary condition for constructive negation in constraint logic programming ⋮ Towards Verifying Logic Programs in the Input Language of clingo ⋮ Here and There among Logics for Logic Programming ⋮ Domain-independent formulas and databases ⋮ Automatic inductive theorem proving using Prolog ⋮ Answer set programming based on propositional satisfiability ⋮ A framework for modular ERDF ontologies ⋮ Incremental Tabling in Support of Knowledge Representation and Reasoning ⋮ A backtracking algorithm for the stream AND-parallel execution of logic programs ⋮ On the transformation of logic programs with instantiation based computation rules ⋮ Logic programming and reasoning with incomplete information ⋮ Functional completion ⋮ A game semantics for disjunctive logic programming ⋮ Eliminating negation from normal logic programs ⋮ A Survey of the Proof-Theoretic Foundations of Logic Programming ⋮ The pragmatic proof: Hypermedia API composition and execution ⋮ First order compiler: A deterministic logic program synthesis algorithm ⋮ Logic programming with sets ⋮ The Prolog not-predicate and negation as failure rule ⋮ Relevant logic programming ⋮ Lloyd-Topor completion and general stable models ⋮ Applying model-checking to solve queries on semistructured data ⋮ Why-provenance information for RDF, rules, and negation ⋮ The alternating fixpoint of logic programs with negation ⋮ Transforming normal logic programs to constraint logic programs ⋮ Equivalence-preserving first-order unfold/fold transformation systems ⋮ Legality concepts for three-valued logic programs ⋮ Declarative error diagnosis ⋮ Computing defeasible meta-logic ⋮ On the duality of abduction and model generation in a framework for model generation with equality

This page was built for publication: Making prolog more expressive