scientific article

Publication date: 1988

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Logic programming logic programming deductive databases Deductive databases

Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Artificial intelligence (68T99) Information storage and retrieval of data (68P20)

Related Items (56)

Equivalences of rewrite programs ⋮ Nonmonotonic reasoning with multiple belief sets ⋮ Logic programs, iterated function systems, and recurrent radial basis function networks ⋮ Equivalence issues in abduction and induction ⋮ A semantics for a class of non-deterministic and causal production system programs ⋮ An incremental concept formation approach for learning from databases ⋮ To Vladimir Lifschitz on His 65th Birthday ⋮ Safe inductions and their applications in knowledge representation ⋮ The expressive powers of stable models for bound and unbound DATALOG queries ⋮ Rewriting queries using views in the presence of arithmetic comparisons ⋮ The rise and fall of semantic rule updates based onSE-models ⋮ Boundedness is undecidable for datalog programs with a single recursive rule ⋮ Modular Paracoherent Answer Sets ⋮ Circumscribing DATALOG: expressive power and complexity ⋮ On the computational cost of disjunctive logic programming: Propositional case ⋮ Eliminating Recursion from Monadic Datalog Programs on Trees ⋮ About boundedness for some datalog and DATALOGneg programs ⋮ $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols ⋮ Certifying standard and stratified Datalog inference engines in SSReflect ⋮ Contractibility for open global constraints ⋮ On Uniform Equivalence of Epistemic Logic Programs ⋮ On the complexity of single-rule datalog queries. ⋮ Stratified resolution ⋮ Proof-theoretic foundations of normal logic programs ⋮ Inductive general game playing ⋮ Datalog extensions for database queries and updates ⋮ Semantics of Horn and disjunctive logic programs ⋮ Copy complexity of Horn formulas with respect to unit read-once resolution ⋮ A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs ⋮ Conjunctive query containment with respect to views and constraints ⋮ Combining explicit negation and negation by failure via Belnap's logic ⋮ Comparison of functional and predicative query paradigms ⋮ Tie-breaking semantics and structural totality ⋮ On the equivalence of recursive and nonrecursive Datalog programs ⋮ Knowledgebase transformations ⋮ How complicated is the set of stable models of a recursive logic program? ⋮ Transforming floundering into success ⋮ The alternating fixpoint of logic programs with negation ⋮ Logical query optimization by proof-tree transformation ⋮ A logic for reasoning with inconsistency ⋮ Low-complexity aggregation in GraphLog and Datalog ⋮ The parallel complexity of single rule logic programs ⋮ Verifying local stratifiability of logic programs and databases ⋮ Complexity of super-coherence problems in ASP ⋮ Magic sets for disjunctive Datalog programs ⋮ Preservation of integrity constraints in definite DATALOG programs ⋮ Decidable containment of recursive queries ⋮ A Transformation-Based Approach to View Updating in Stratifiable Deductive Databases ⋮ Paraconsistent logic programming ⋮ Complexity results for probabilistic answer set programming ⋮ Preface ⋮ Negation in rule-based database languages: A survey ⋮ Answer Set Programming: A Primer ⋮ Combining Horn rules and description logics in CARIN ⋮ Sequences, datalog, and transducers ⋮ Semi-equilibrium models for paracoherent answer set programs

This page was built for publication: