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

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 ⋮ 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 ⋮ A relative interpolation theorem for infinitary universal Horn logic and its applications ⋮ AND parallelism and nondeterminism in logic programs ⋮ A declarative approach for first-order built-in's of Prolog ⋮ Modelling the combination of functional and logic programming languages ⋮ Logic programming in tensor spaces ⋮ Bottom-up evaluation of datalog with negation ⋮ On the relationship between TMS and logic programs ⋮ Time-extraction for temporal logic -- logic programming and local process time ⋮ On solving the equality problem in theories defined by Horn clauses ⋮ Evaluating epistemic negation in answer set programming ⋮ A three-valued semantics for deductive databases and logic programs ⋮ An algorithm for determining database consistency under the closed world assumption ⋮ Semantics of infinite tree logic programming ⋮ Partial models and logic programming ⋮ Fast algorithms for testing unsatisfiability of ground Horn clauses with equations ⋮ A fixpoint semantics of Horn sentences based on substitution sets ⋮ Parallel complexity of logical query programs ⋮ Conceptual logic programs ⋮ The generalized counting method for recursive logic queries ⋮ Contributions to the semantics of logic perpetual processes ⋮ Inferring negative information from disjunctive databases ⋮ On the relationship between circumscription and negation as failure ⋮ Pseudo-Boolean valued Prolog ⋮ Ultimate approximation and its application in nonmonotonic knowledge representation systems ⋮ Circumscribing DATALOG: expressive power and complexity ⋮ Programming in metric temporal logic ⋮ A game semantics for disjunctive logic programming ⋮ Grounded fixpoints and their applications in knowledge representation ⋮ Inductive equivalence in clausal logic and nonmonotonic logic programming ⋮ CAL: A theoretical background of constraint logic programming and its applications ⋮ Logic programming with sets ⋮ Checking functional consistency in deductive databases ⋮ Semantics of structured normal logic programs ⋮ Declarative modeling of the operational behavior of logic languages ⋮ Semantics for logic programs without occur check ⋮ Hypothetical datalog: Complexity and expressibility ⋮ Hypothetical reasoning in logic programming: A semantic approach ⋮ Recursion equation sets computing logic programs ⋮ Abductive logic programming agents with destructive databases ⋮ Semantic models for concurrent logic languages ⋮ Semantics of Horn and disjunctive logic programs ⋮ Horn clause programs with polymorphic types: Semantics and resolution ⋮ Derivation of logic programs by functional methods ⋮ A simple fixed point characterization of three-valued stable model semantics ⋮ Domains for logic programming ⋮ Nondeterminism and infinite computations in constraint programming ⋮ Fully abstract compositional semantics for an algebra of logic programs

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