Contributions to the Theory of Logic Programming
From MaRDI portal
Publication:3942361
DOI10.1145/322326.322339zbMath0483.68004OpenAlexW2143382644MaRDI QIDQ3942361
Krzysztof R. Apt, Maarten H. Van Emden
Publication date: 1982
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/10272
continuitycompletenessblockingterminationSLD-resolutionfixpoint semanticstheorem provergreatest fixpointshigh-level programming languageHorn classes of first-order predicate logicnondeterministic flowchart schematasemantic characterization of termination
Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)
Related Items
A First Order Logic Benchmark for Defeasible Reasoning Tool Profiling ⋮ Definite Formulae, Negation-as-Failure, and the Base-Extension Semantics of Intuitionistic Propositional Logic ⋮ A relative interpolation theorem for infinitary universal Horn logic and its applications ⋮ On Well-Founded Set-Inductions and Locally Monotone Operators ⋮ Modelling the combination of functional and logic programming languages ⋮ Formalizing incomplete knowledge in incomplete databases ⋮ Partial models and logic programming ⋮ Formalizing a logic for logic programming ⋮ Fast algorithms for testing unsatisfiability of ground Horn clauses with equations ⋮ A fixpoint semantics of Horn sentences based on substitution sets ⋮ Definite clause programs are canonical (over a suitable domain) ⋮ The fixed points of logic programs with Herbrand base \({\mathbb{N}}\) ⋮ Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming ⋮ Uniform proofs as a foundation for logic programming ⋮ Can we transform logic programs into attribute grammars ? ⋮ Parallel complexity of logical query programs ⋮ Inductive assertion method for logic pograms ⋮ Incomplete deductive databases ⋮ Contributions to the semantics of logic perpetual processes ⋮ Contextual Abductive Reasoning with Side-Effects ⋮ Ultimate approximation and its application in nonmonotonic knowledge representation systems ⋮ Minimalism, justification and non-monotonicity in deductive databases ⋮ Complexity and undecidability results for logic programming ⋮ Programming in metric temporal logic ⋮ Modeling the suppression task under weak completion and well-founded semantics ⋮ Domain theory for nonmonotonic functions ⋮ A logical semantics for depth-first Prolog with ground negation ⋮ Multi-dimensional logic programming: theoretical foundations ⋮ A Survey of the Proof-Theoretic Foundations of Logic Programming ⋮ Encoding transition systems in sequent calculus ⋮ In Praise of Impredicativity: A Contribution to the Formalization of Meta-Programming ⋮ Abstract argumentation systems ⋮ The fuzzy logic programming language FASILL: design and implementation ⋮ On completeness of narrowing strategies ⋮ Simple operational and denotational semantics for Prolog with cut ⋮ 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 ⋮ Comparative metric semantics for concurrent PROLOG ⋮ Finite failures and partial computations in concurrent logic languages ⋮ A declarative semantics of flat guarded Horn clauses for programs with perpetual processes ⋮ Recursion equation sets computing logic programs ⋮ Sémantique logique et dénotationnelle des interpréteurs PROLOG ⋮ Why not negation by fixpoint? ⋮ An analysis of loop checking mechanisms for logic programs ⋮ Semantics of Horn and disjunctive logic programs ⋮ Horn clause programs with polymorphic types: Semantics and resolution ⋮ An operational formal definition of PROLOG: A specification method and its application ⋮ Extending Horn clause logic with implication goals ⋮ Logic and functional programming by retractions : operational semantics ⋮ Learning Boolean logic models of signaling networks with ASP ⋮ Compositional operational semantics for Prolog programs ⋮ Multi-valued logic programming semantics An algebraic approach ⋮ Complete extension of general logic programs ⋮ Tie-breaking semantics and structural totality ⋮ Reusing and modifying rulebases by predicate substitution ⋮ An explication of reasoning in multiple inheritance systems through non- monotonic Horn clause logic ⋮ Completions of perpetual logic programs ⋮ From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic ⋮ Transforming floundering into success ⋮ Proof methods of declarative properties of definite programs ⋮ The alternating fixpoint of logic programs with negation ⋮ Semantics of temporal constrained objects ⋮ The parallel complexity of single rule logic programs ⋮ Compositional model-theoretic semantics for logic programs ⋮ Automated verification of state sequence invariants in general game playing ⋮ \(\exists\)-Universal termination of logic programs ⋮ Multimodal logic programming ⋮ A sound and complete semantics for a similarity-based logic programming language ⋮ Quantitative Logic Programming Revisited ⋮ Least and Greatest Fixed Points in Linear Logic ⋮ Bottom-up evaluation of Datalog programs with arithmetic constraints ⋮ Qualified Logic Programming with Bivalued Predicates ⋮ Recursive query processing: The power of logic ⋮ Semantics of distributed definite clause programs ⋮ A relational approach to logic programming: The extended Alexander method ⋮ Bounds in the propagation of selection into logic programs ⋮ Programming in three-valued logic ⋮ Negation in rule-based database languages: A survey ⋮ Negation by default and unstratifiable logic programs ⋮ Horn equational theories and paramodulation ⋮ Weak generalized closed world assumption ⋮ Possible worlds and resources: The semantics of \(\mathbf{BI}\) ⋮ Completeness of hyper-resolution via the semantics of disjunctive logic programs ⋮ FTClogic: fuzzy temporal constraint logic ⋮ Logic programs, well-orderings, and forward chaining ⋮ Rational set of trees and the algebraic semantics of logic programming ⋮ On the verification of finite failure ⋮ Towards a programming language based on the notion of two-level grammar ⋮ A polymorphic type system for Prolog ⋮ An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. ⋮ Closures and fairness in the semantics of programming logic ⋮ Backchain iteration: Towards a practical inference method that is simple enough to be proved terminating, sound, and complete ⋮ The expressive power of stratified logic programs ⋮ Is there an axiomatic semantics for standard pure Prolog? ⋮ Fixpoint semantics for logic programming a survey ⋮ A denotational semantics and dataflow construction for logic programs ⋮ Optimal fixedpoints of logic programs ⋮ Logical debugging ⋮ Foundation of logic programming based on inductive definition
