Contributions to the Theory of Logic Programming
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Completeness of hyper-resolution via the semantics of disjunctive logic programs
- Rational set of trees and the algebraic semantics of logic programming
- Optimal fixedpoints of logic programs
- Foundation of logic programming based on inductive definition
- Modelling the combination of functional and logic programming languages
- 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
- Inductive assertion method for logic pograms
- Contributions to the semantics of logic perpetual processes
- Minimalism, justification and non-monotonicity in deductive databases
- Programming in metric temporal logic
- 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
- Compositional operational semantics for Prolog programs
- Complete extension of general logic programs
- 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
- The parallel complexity of single rule logic programs
- Compositional model-theoretic semantics for logic programs
- Recursive query processing: The power of logic
- Semantics of distributed definite clause programs
- A relational approach to logic programming: The extended Alexander method
- Logic programs, well-orderings, and forward chaining
- Backchain iteration: Towards a practical inference method that is simple enough to be proved terminating, sound, and complete
- A denotational semantics and dataflow construction for logic programs
- Logical debugging
- Formalizing incomplete knowledge in incomplete databases
- Formalizing a logic for logic programming
- Definite clause programs are canonical (over a suitable domain)
- Incomplete deductive databases
- A logical semantics for depth-first Prolog with ground negation
- Multi-dimensional logic programming: theoretical foundations
- Encoding transition systems in sequent calculus
- Abstract argumentation systems
- Fixpoint semantics for logic programming a survey
- Automated verification of state sequence invariants in general game playing
- Bounds in the propagation of selection into logic programs
- Horn equational theories and paramodulation
- Weak generalized closed world assumption
- Possible worlds and resources: The semantics of \(\mathbf{BI}\)
- An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
- Complexity and undecidability results for logic programming
- Semantics of temporal constrained objects
- The fuzzy logic programming language FASILL: design and implementation
- FTClogic: fuzzy temporal constraint logic
- Multimodal logic programming
- On the verification of finite failure
- 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
- Qualified logic programming with bivalued predicates
- Contextual abductive reasoning with side-effects
- Sémantique logique et dénotationnelle des interpréteurs PROLOG
- Logic and functional programming by retractions : operational semantics
- Can we transform logic programs into attribute grammars ?
- Semantics of structured normal logic programs
- Modeling the suppression task under weak completion and well-founded semantics
- Learning Boolean logic models of signaling networks with ASP
- Domain theory for nonmonotonic functions
- In praise of impredicativity: a contribution to the formalization of meta-programming
- Bottom-up evaluation of Datalog programs with arithmetic constraints
- On well-founded set-inductions and locally monotone operators
- Transforming floundering into success
- Quantitative Logic Programming Revisited
- -Universal termination of logic programs
- Ultimate approximation and its application in nonmonotonic knowledge representation systems
- A Survey of the Proof-Theoretic Foundations of Logic Programming
- A First Order Logic Benchmark for Defeasible Reasoning Tool Profiling
- Definite Formulae, Negation-as-Failure, and the Base-Extension Semantics of Intuitionistic Propositional Logic
- Reductive logic, proof-search, and coalgebra: a perspective from resource semantics
- Multi-valued logic programming semantics An algebraic approach
- Tie-breaking semantics and structural totality
- Reusing and modifying rulebases by predicate substitution
- Proof methods of declarative properties of definite programs
- The alternating fixpoint of logic programs with negation
- A sound and complete semantics for a similarity-based logic programming language
- Modern Datalog: concepts, methods, applications (invited paper)
- Programming in three-valued logic
- Negation in rule-based database languages: A survey
- Negation by default and unstratifiable logic programs
- Towards a programming language based on the notion of two-level grammar
- A polymorphic type system for Prolog
- Closures and fairness in the semantics of programming logic
- The expressive power of stratified logic programs
- Is there an axiomatic semantics for standard pure Prolog?
- A relative interpolation theorem for infinitary universal Horn logic and its applications
- On completeness of narrowing strategies
- Simple operational and denotational semantics for Prolog with cut
- 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
This page was built for publication: Contributions to the Theory of Logic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3942361)
