The Semantics of Predicate Logic as a Programming Language

DOI10.1145/321978.321991zbMath0339.68004OpenAlexW2108911687WikidataQ56227333 ScholiaQ56227333MaRDI QIDQ4107888

Robert Kowalski, Maarten H. Van Emden

Publication date: 1976

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321978.321991

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10) Classical first-order logic (03B10) General topics in the theory of software (68N01)

Related Items (only showing first 100 items - show all)

Backdoors to Normality for Disjunctive Logic Programs ⋮ On Well-Founded Set-Inductions and Locally Monotone Operators ⋮ Witnesses for Answer Sets of Logic Programs ⋮ RustHorn: CHC-Based Verification for Rust Programs ⋮ Intuitionistic three-valued logic and logic programming ⋮ Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs ⋮ Algèbres effectives dans la programmation logique avec contraintes ⋮ Modeling the suppression task under weak completion and well-founded semantics ⋮ Domain theory for nonmonotonic functions ⋮ Eliminating negation from normal logic programs ⋮ Recursive query processing in predicate-goal graph ⋮ A refinement of import/export declarations in modular logic programming and its semantics ⋮ On logical constraints in logic programming ⋮ An operator for composing deductive data bases with theories of constraints ⋮ Stable classes and operator pairs for disjunctive programs ⋮ Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT ⋮ Fifty Years of Prolog and Beyond ⋮ A Survey of the Proof-Theoretic Foundations of Logic Programming ⋮ Fixpoint semantics and optimization of recursive Datalog programs with aggregates ⋮ Knowledge compilation of logic programs using approximation fixpoint theory ⋮ An infinitary encoding of temporal equilibrium logic ⋮ Deriving conclusions from non-monotonic cause-effect relations ⋮ Temporal logic programs with variables ⋮ Fuzzy logic programs as hypergraphs. Termination results ⋮ Immediate consequences operator on generalized quantifiers ⋮ Semantics for abstract clauses ⋮ Typed SLD-resolution: dynamic typing for logic programming ⋮ In Praise of Impredicativity: A Contribution to the Formalization of Meta-Programming ⋮ Temporal ASP: from logical foundations to practical use with \texttt{telingo} ⋮ Foundations of linear-time logic programming ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An assumption-based truth maintenance system dealing with non-ground justifications ⋮ Contextual hypotheses and semantics of logic programs ⋮ A declarative extension of horn clauses, and its significance for datalog and its applications ⋮ Transforming floundering into success ⋮ Variable binding operators in transition system specifications ⋮ Explaining Preferences and Preferring Explanations ⋮ Proofs as computations in linear logic ⋮ Freeness in classes without equality ⋮ Reasoning About Data Trees Using CHCs ⋮ Generalized well-founded semantics for logic programs ⋮ Answering the “why” in answer set programming – A survey of explanation approaches ⋮ Quantitative Logic Programming Revisited ⋮ Bottom-up evaluation of Datalog programs with arithmetic constraints ⋮ Unfolding and fixpoint semantics of concurrent constraint logic programs ⋮ Sound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs ⋮ Twelve Definitions of a Stable Model ⋮ A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction ⋮ A domain-theoretic approach to functional and logic programming ⋮ Lifted Reasoning for Combinatorial Counting ⋮ Satisfiability, Lattices, Temporal Logic and Constraint Logic Programming on Intervals ⋮ An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms ⋮ Evolution of rule-based programs ⋮ Learning from interpretation transition using differentiable logic programming semantics ⋮ Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete ⋮ Formalizing incomplete knowledge in incomplete databases ⋮ A neural implementation of multi-adjoint logic programming ⋮ Linearisability on Datalog programs ⋮ Parametrized semantics of logic programs -- a unifying framework ⋮ Termination of logic programs with imperfect information: applications and query procedure ⋮ A Formal Theory of Justifications ⋮ Minimal belief and negation as failure ⋮ To Vladimir Lifschitz on His 65th Birthday ⋮ Causal Logic Programming ⋮ Oscillating Behavior of Logic Programs ⋮ Disjunctive Programs with Set Constraints ⋮ Beyond multi-adjoint logic programming ⋮ An alternative approach to the semantics of disjunctive logic programs and deductive databases ⋮ First-order theories for pure Prolog programs with negation ⋮ Logic programming with solution preferences ⋮ Unique satisfiability of Horn sets can be solved in nearly linear time ⋮ Forward Chaining for Hybrid ASP ⋮ A semantics for \(\lambda \)Prolog ⋮ An abstract interpretation framework for optimizing dynamic modular logic languages ⋮ Optimality in goal-dependent analysis of Sharing ⋮ Disjunctive \(LP+\) integrity constraints = stable model semantics. ⋮ Formalizing a logic for logic programming ⋮ Kernel-LEAF: A logic plus functional language ⋮ On stratified disjunctive programs ⋮ The fixed points of logic programs with Herbrand base \({\mathbb{N}}\) ⋮ Uniform proofs as a foundation for logic programming ⋮ Safe inductions and their applications in knowledge representation ⋮ Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach ⋮ Parallelism in logic programs ⋮ Automatic synthesis of logical models for order-sorted first-order theories ⋮ Constraint logic programming with dynamic scheduling: A semantics based on closure operators ⋮ Dynamic graph models ⋮ Unnamed Item ⋮ Causal Graph Justifications of Logic Programs ⋮ Truth versus information in logic programming ⋮ Obligation as optimal goal satisfaction ⋮ Thresholded semantic framework for a fully integrated fuzzy logic language ⋮ Jack Minker --- A profile ⋮ Nonrecursive incremental evaluation of Datalog queries ⋮ The expressiveness of locally stratified programs ⋮ Well-founded and stationary models of logic programs

This page was built for publication: The Semantics of Predicate Logic as a Programming Language