The Semantics of Predicate Logic as a Programming Language
DOI10.1145/321978.321991zbMATH Open0339.68004OpenAlexW2108911687WikidataQ56227333 ScholiaQ56227333MaRDI QIDQ4107888FDOQ4107888
Authors: Robert Kowalski, M. 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
General topics in the theory of software (68N01) Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10) Classical first-order logic (03B10)
Cited In (only showing first 100 items - show all)
- Logic programming in tensor spaces
- Semantics of infinite tree logic programming
- Freeness in classes without equality
- On the autoepistemic reconstruction of logic programming
- Programming in three-valued logic
- A typed resolution principle for deduction with conditional typing theory
- Logic programs with abstract constraint atoms: the role of computations
- Some (in)translatability results for normal logic programs and propositional theories
- Horn clause programs with polymorphic types: Semantics and resolution
- An alternative approach to the semantics of disjunctive logic programs and deductive databases
- The expressiveness of locally stratified programs
- A semantics for \(\lambda \)Prolog
- Formalizing a logic for logic programming
- The generalized counting method for recursive logic queries
- Intuitionistic three-valued logic and logic programming
- Conceptual logic programs
- Horn clause solvers for program verification
- Variable binding operators in transition system specifications
- A sound and complete semantics for a similarity-based logic programming language
- Contextual hypotheses and semantics of logic programs
- Preference logics: Towards a unified approach to nonmonotonicity in deductive reasoning
- Embedding deductive capabilities in relational database systems
- On the duality of abduction and model generation in a framework for model generation with equality
- Title not available (Why is that?)
- Complexity and undecidability results for logic programming
- Sémantique logique et dénotationnelle des interpréteurs PROLOG
- Grounded fixpoints and their applications in knowledge representation
- The semantics of incomplete databases as an expression of preferences
- S-semantics for logic programming: a retrospective look
- Semantics of algorithmic languages
- Transforming normal logic programs to constraint logic programs
- Unfolding and fixpoint semantics of concurrent constraint logic programs
- Minimal belief and negation as failure
- A proof procedure for the logic of hereditary Harrop formulas
- Completeness of hyper-resolution via the semantics of disjunctive logic programs
- CAL: A theoretical background of constraint logic programming and its applications
- Checking functional consistency in deductive databases
- Semantics for logic programs without occur check
- Pseudo-Boolean valued Prolog
- Generalized well-founded semantics for logic programs
- Revision programming
- A fixpoint semantics of Horn sentences based on substitution sets
- Backdoors to tractable answer set programming
- Hypothetical datalog: Complexity and expressibility
- Hypothetical reasoning in logic programming: A semantic approach
- Recursion equation sets computing logic programs
- Rational set of trees and the algebraic semantics of logic programming
- A new combination of input and unit deductions for Horn sentences
- Modelling the combination of functional and logic programming languages
- From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic
- A neural implementation of multi-adjoint logic programming
- Parametrized semantics of logic programs -- a unifying framework
- Title not available (Why is that?)
- Is there an axiomatic semantics for standard pure Prolog?
- Domain theory for nonmonotonic functions
- Bottom-up evaluation of Datalog programs with arithmetic constraints
- Theory revision with queries: Horn, read-once, and parity formulas
- A relative interpolation theorem for infinitary universal Horn logic and its applications
- On solving the equality problem in theories defined by Horn clauses
- Optimality in goal-dependent analysis of Sharing
- Complete extension of general logic programs
- Fixpoint semantics and optimization of recursive Datalog programs with aggregates
- A refinement of import/export declarations in modular logic programming and its semantics
- Logic program forms
- Closures and fairness in the semantics of programming logic
- Equational properties of stratified least fixed points (extended abstract)
- Causal graph justifications of logic programs
- Uniform semantic treatment of default and autoepistemic logics
- Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
- Semantics of Horn and disjunctive logic programs
- Logic programming with sets
- A declarative approach for first-order built-in's of Prolog
- A new framework for declarative programming
- A superposition oriented theorem prover
- Optimal fixedpoints of logic programs
- Compiling problem specifications into SAT
- AND parallelism and nondeterminism in logic programs
- Contributions to the semantics of logic perpetual processes
- Inferring negative information from disjunctive databases
- The fuzzy logic programming language FASILL: design and implementation
- Semantic models for concurrent logic languages
- How complicated is the set of stable models of a recursive logic program?
- Compositional model-theoretic semantics for logic programs
- Multi-valued logic programming semantics An algebraic approach
- Proofs as computations in linear logic
- A fixed point theorem for non-monotonic functions
- The alternating fixpoint of logic programs with negation
- Disjunctive \(LP+\) integrity constraints = stable model semantics.
- Twelve Definitions of a Stable Model
- Partial models and logic programming
- Abductive logic programming agents with destructive databases
- Approximation fixpoint theory and the well-founded semantics of higher-order logic programs
- Horn equational theories and paramodulation
- Inductive equivalence in clausal logic and nonmonotonic logic programming
- Evaluating epistemic negation in answer set programming
- Loop-separable programs and their first-order definability
- Automatic synthesis of logical models for order-sorted first-order theories
- Weak generalized closed world assumption
- Multimodal logic programming
- Unique satisfiability of Horn sets can be solved in nearly linear time
This page was built for publication: The Semantics of Predicate Logic as a Programming Language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4107888)