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

semanticslogic programmingfirst order logicmany-sorted predicate calculusdeductive database systemsHorn clause programresolution proof search tree

Mathematics Subject Classification ID

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

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

(37)

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

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)