Foundations of logic programming.
answer substitutionclosed world assumptioncompletenessdeclarative semanticsfixed-point theoryHerbrand modelinfinite computationlogic programmingnegation as failure ruleprocedural semanticsPROLOGSLD-resolutionsoundnessunification
Mechanization of proofs and logical operations (03B35) Model theory (03C99) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Symbolic computation and algebraic computation (68W30)
See the review of the first edition (1984) in Zbl 0547.68005.
- Abstract interpretation of resolution-based semantics
- A hybrid programming scheme combining fuzzy-logic and functional-logic resources
- Inferring negative information from disjunctive databases
- Interleaving natural language parsing and generation through uniform processing
- Graph traversal and top-down evaluation of logic queries
- Between constructive mathematics and PROLOG
- Acyclic logic programs and the completeness of SLDNF-resolution
- Derivation of logic programs by functional methods
- Compositional operational semantics for Prolog programs
- Stable and extension class theory for logic programs and default logics
- Compositional model-theoretic semantics for logic programs
- Graph properties for normal logic programs
- A semantics for modular general logic programs
- Driving tabu search with case-based reasoning
- OLDTNF-based evaluation method for handling recursive queries in deductive databases
- Completeness issues in RUE-NRF deduction: The undecidability of viability
- Dualities between alternative semantics for logic programming and nonmonotonic reasoning
- A semantical framework for supporting subjective and conditional probabilities in deductive databases
- A compositional semantics for logic programs
- Information categories
- Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation
- Bounded quantifications for iteration and concurrency in logic programming
- Undecidable goals for completed acyclic programs
- A declarative approach for first-order built-in's of Prolog
- On the relationship between TMS and logic programs
- Update operations in deductive databases with functional dependencies
- Intuitionistic interpretation of deductive databases with incomplete information
- What is failure? An approach to constructive negation
- Specification, verification and prototyping of an optimized compiler
- Reasoning about prolog programs: From modes through types to assertions
- A hypergraph model for constraint logic programming and applications to bus drivers' scheduling
- Describing symmetrical structures in logic.
- On the monotonicity of (LDL) logic programs with set.
- Definite clause programs are canonical (over a suitable domain)
- Running programs backwards: The logical inversion of imperative computation
- Intelligent backtracking in \(\text{CLP}(\Re)\)
- Polynomial-time computable stable models
- The least fixpoint transformation for disjunctive logic programs
- Confluence in concurrent constraint programming
- Computing answers with model elimination
- \(\mathcal I\)-SATCHMORE: An improvement of \(\mathcal A\)-SATCHMORE
- Methods of solution and criteria of consistency of systems of linear Diophantine equations over the set of natural numbers
- Abductive reasoning through filtering
- Renaming a set of non-Horn clauses
- Mind change complexity of learning logic programs
- The ^2 fragment of the first-order theory of atomic set constraints is _1⁰-hard
- The expressiveness of DAC
- Open problems in universal induction \& intelligence
- Certifying standard and stratified Datalog inference engines in SSReflect
- Planning in hybrid relational MDPs
- A polymorphic type dependency analysis for logic programs
- Automated verification of state sequence invariants in general game playing
- Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics
- Syntax and semantics of multi-adjoint normal logic programming
- Relating CASL with other specification languages: the institution level.
- Learning closed Horn expressions
- SATCHMOREBID: SATCHMO(RE) with BIDirectional relevancy
- Model checking mobile ambients
- A logic programming system for nonmonotonic reasoning
- First-order theories for pure Prolog programs with negation
- Default reasoning by deductive planning
- Asynchronous communication model based on linear logic
- Shifting vocabulary bias in speedup learning
- Contextual nets
- A study of a dice problem
- Middle-out reasoning for synthesis and induction
- Reasoning about actions and obligations in first-order logic
- The expressiveness of locally stratified programs
- Well-founded and stationary models of logic programs
- Complexity and undecidability results for logic programming
- Representing diagnosis knowledge
- Controlling the complexity in model-based diagnosis
- Negation as failure for disjunctive logic programming
- Dealing with explicit preferences and uncertainty in answer set programming
- Constraint-based correctness proofs for logic program transformations
- Fast learning of relational kernels
- Heterogeneous active agents. III: Polynomially implementable agents
- Logic programming: laxness and saturation
- Removing algebraic data types from constrained Horn clauses using difference predicates
- Learning explanations for biological feedback with delays using an event calculus
- Nonlinear pattern matching in rule-based modeling languages
- Assumption-based argumentation is logic programming with projection
- Explanations as programs in probabilistic logic programming
- FOLD-R++: a scalable toolset for automated inductive learning of default theories from mixed data
- Logical reduction of metarules
- Extended multi-adjoint logic programming
- Game description language and dynamic epistemic logic compared
- Mining closed patterns in relational, graph and network data
- Why-provenance information for RDF, rules, and negation
- A framework for computing finite SLD trees
- Efficient and flexible access control via Jones-optimal logic program specialisation
- Totally correct logic program transformations via well-founded annotations
- Multi-context systems in dynamic environments
- The dramatic true story of the frame default
- Feasibility checking in Horn constraint systems through a reduction based approach
- On the use of stochastic local search techniques to revise first-order logic theories from examples
- Precise specification matching for adaptive reuse in embedded systems
- Controlled query evaluation with open queries for a decidable relational submodel
- On fuzzy unfolding: A multi-adjoint approach
- Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds
This page was built for publication: Foundations of logic programming.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3992908)