Making prolog more expressive

DOI10.1016/0743-1066(84)90011-6MaRDI QIDQ3707363zbMATH OpenOpenAlexFDO

Authors John W. Lloyd, Rodney W. Topor

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

deductive database systemsfirst order logicHorn clause programlogic programmingmany-sorted predicate calculusresolution proof search treesemantics

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4074450
• scientific article; zbMATH DE number 1200168
• scientific article; zbMATH DE number 52709
• The Prolog not-predicate and negation as failure rule
• N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure

Cited in

(40)

• Computation of full logic programs using one-variable environments
• Domain-independent formulas and databases
• Automatic inductive theorem proving using Prolog
• A backtracking algorithm for the stream AND-parallel execution of logic programs
• On the transformation of logic programs with instantiation based computation rules
• Relevant logic programming
• Transforming normal logic programs to constraint logic programs
• Equivalence-preserving first-order unfold/fold transformation systems
• On the duality of abduction and model generation in a framework for model generation with equality
• Bounded quantifications for iteration and concurrency in logic programming
• Applying model-checking to solve queries on semistructured data
• Logic programming and reasoning with incomplete information
• Computing defeasible meta-logic
• Why-provenance information for RDF, rules, and negation
• Reactive computing as model generation
• Here and there among logics for logic programming
• Incremental Tabling in Support of Knowledge Representation and Reasoning
• A necessary condition for constructive negation in constraint logic programming
• A framework for modular ERDF ontologies
• scientific article; zbMATH DE number 4074450 (Why is no real title available?)
• A game semantics for disjunctive logic programming
• The expressive power of side effects in prolog
• Functional completion
• The pragmatic proof: hypermedia API composition and execution
• Towards Verifying Logic Programs in the Input Language of clingo
• Eliminating negation from normal logic programs
• Logic Programming
• Lloyd-Topor completion and general stable models
• Declarative error diagnosis
• A Survey of the Proof-Theoretic Foundations of Logic Programming
• Substitution-based compilation of extended rules in deductive databases
• The alternating fixpoint of logic programs with negation
• Legality concepts for three-valued logic programs
• Techniques for measuring the inferential strength of forgetting policies
• Positive dependency graphs revisited
• On program completion, with an application to the sum and product puzzle
• Answer set programming based on propositional satisfiability
• First order compiler: A deterministic logic program synthesis algorithm
• Logic programming with sets
• The Prolog not-predicate and negation as failure rule

This page was built for publication: Making prolog more expressive

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3707363)