scientific article; zbMATH DE number 3872640
From MaRDI portal
Publication:3339245
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)
Recommendations
Cited in
(only showing first 100 items - show all)- On the algebraic structure of declarative programming languages
- S-semantics for logic programming: a retrospective look
- Completeness of hyper-resolution via the semantics of disjunctive logic programs
- Computation of full logic programs using one-variable environments
- AID: an alternative implementation of DCGs
- Semantics of infinite tree logic programming
- Domain-independent formulas and databases
- Making exhaustive search programs deterministic
- Negation as failure: careful closure procedure
- Embedding Boolean expressions into logic programming
- Negation as failure. Completeness of the query evaluation process for Horn clause programs with recursive definitions
- Inductive assertion method for logic pograms
- Applications of compactness in the Smyth powerdomain of streams
- Mixed computation of Prolog programs
- Generalized subsumption and its applications to induction and redundancy
- Contributions to the semantics of logic perpetual processes
- On the relationship between circumscription and negation as failure
- Minimalism, justification and non-monotonicity in deductive databases
- On the relationship of congruence closure and unification
- A rewrite mechanism for logic programs with negation
- A note on the stable model semantics for logic programs
- Linear generalized semi-monadic rewrite systems effectively preserve recognizability
- A refined architecture for terminological systems: Terminology = Schema + Views
- Programming in metric temporal logic
- Algebraic structures in categorial grammar
- Information flow in tabular interpretations for generalized push-down automata
- General logical databases and programs: Default logic semantics and stratification
- An analysis of loop checking mechanisms for logic programs
- Semantics of Horn and disjunctive logic programs
- Unfold/fold transformation of stratified programs
- Horn clause programs with polymorphic types: Semantics and resolution
- Relevant logic programming
- Three-valued nonmonotonic formalisms and semantics of logic programs
- A simple fixed point characterization of three-valued stable model semantics
- Paraconsistent disjunctive deductive databases
- Domains for logic programming
- Contraction algebras and unification of (infinite) terms
- An operational formal definition of PROLOG: A specification method and its application
- A typed functional extension of logic programming
- Extending Horn clause logic with implication goals
- Learning elementary formal systems
- A methodology for detecting shared variable dependencies in logic programs
- Complete extension of general logic programs
- Declarative testing of logic databases
- Mints type deductive calculi for logic programming
- A semantic backward chaining proof system
- An explication of reasoning in multiple inheritance systems through non- monotonic Horn clause logic
- A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses
- A slight strengthening of a theorem of Blair and Kunen
- Completions of perpetual logic programs
- From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Counting propositional models
- Free fuzzy groups and fuzzy group presentations
- An algebraic semantics for structured transition systems and its application to logic programs
- Testing logic programs for local stratification
- The relationship between stable, supported, default and autoepistemic semantics for general logic programs
- Multimodal logic programming using equational and order-sorted logic
- Linear resolution for consequence finding
- Generalizing completeness results for loop checks in logic programming
- A new SLDNF-tree
- On the relations between stable and well-founded semantics of logic programs
- Transforming normal logic programs to constraint logic programs
- Equivalence-preserving first-order unfold/fold transformation systems
- Verifying local stratifiability of logic programs and databases
- Probabilistic logic programming
- Preservation of integrity constraints in definite DATALOG programs
- An execution mechanism for nondeterministic, state-oriented programs based on a chart parser
- Recursive query processing: The power of logic
- Paraconsistent logic programming
- Semantics of distributed definite clause programs
- A relational approach to logic programming: The extended Alexander method
- Top-down induction of first-order logical decision trees
- Compositionality properties of SLD-derivations
- Transforming constraint logic programs
- Expressive power and complexity of partial models for disjunctive deductive databases
- Soundness of abductive proof procedure with respect to constraint for non-ground abducibles
- Recovery of (non)monotonic theories
- Functional-logic integration via minimal reciprocal extensions
- Sequences, datalog, and transducers
- An implementation of Kripke-Kleene semantics
- Free fuzzy modules and their bases
- Type inference in Prolog: A new approach
- Weighted systems of equations
- On computational complexity of Prolog programs
- Probabilistic Horn abduction and Bayesian networks
- Logic program synthesis from first-order logic specifications
- Sound and complete partial deduction with unfolding based on well-founded measures
- An abstract machine for concurrent modular systems: CHARM
- The number of \(Q\)-congruences in positive algebras
- Norms on terms and their use in proving universal termination of a logic program
- Bottom-up abstract interpretation of logic programs
- Left termination turned into termination
- Logical debugging
- Computing definite logic programs by partial instantiation
- A resolution principle for constrained logics
- IDNAF Prolog
- The role of standardising apart in logic programming
- A logic-based approach to query processing in federated databases
- Autoepistemic logic programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3339245)
