scientific article; zbMATH DE number 4147465
From MaRDI portal
Publication:3477931
Cited in
(74)- Boundedness is undecidable for datalog programs with a single recursive rule
- Circumscribing DATALOG: expressive power and complexity
- Datalog extensions for database queries and updates
- Semantics of Horn and disjunctive logic programs
- How complicated is the set of stable models of a recursive logic program?
- The parallel complexity of single rule logic programs
- Verifying local stratifiability of logic programs and databases
- Preservation of integrity constraints in definite DATALOG programs
- Paraconsistent logic programming
- Combining Horn rules and description logics in CARIN
- Sequences, datalog, and transducers
- A semantics for a class of non-deterministic and causal production system programs
- An incremental concept formation approach for learning from databases
- The expressive powers of stable models for bound and unbound DATALOG queries
- Uncertain deductive databases: a hybrid approach
- On the complexity of single-rule datalog queries.
- Stratified resolution
- Safe inductions and their applications in knowledge representation
- Certifying standard and stratified Datalog inference engines in SSReflect
- Magic sets for disjunctive Datalog programs
- Logic programs, iterated function systems, and recurrent radial basis function networks
- On the computational cost of disjunctive logic programming: Propositional case
- Inductive general game playing
- Copy complexity of Horn formulas with respect to unit read-once resolution
- Complexity results for probabilistic answer set programming
- Semi-equilibrium models for paracoherent answer set programs
- To Vladimir Lifschitz on His 65th Birthday
- The rise and fall of semantic rule updates based on SE-models
- Modular paracoherent answer sets
- Eliminating recursion from monadic datalog programs on trees
- COMPUTING THE WELL-FOUNDED MODEL OF DEDUCTIVE DATABASES
- scientific article; zbMATH DE number 410424 (Why is no real title available?)
- scientific article; zbMATH DE number 4199653 (Why is no real title available?)
- scientific article; zbMATH DE number 4199656 (Why is no real title available?)
- $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
- Logic Programming Languages for Databases and the Web
- Answer Set Programming: A Primer
- A basis for deductive database systems II
- scientific article; zbMATH DE number 53282 (Why is no real title available?)
- scientific article; zbMATH DE number 545140 (Why is no real title available?)
- Intuitionistic deductive databases and the polynomial time hierarchy
- Preface
- Contractibility for open global constraints
- Nonmonotonic reasoning with multiple belief sets
- scientific article; zbMATH DE number 2085287 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 870410 (Why is no real title available?)
- About boundedness for some DATALOG and DATALOG\textsuperscript{neg} programs
- On uniform equivalence of epistemic logic programs
- Transforming floundering into success
- Complexity of super-coherence problems in ASP
- Efficient and Scalable Induction of Logic Programs Using a Deductive Database System
- A Transformation-Based Approach to View Updating in Stratifiable Deductive Databases
- Decidable containment of recursive queries
- Equivalences of rewrite programs
- Proof-theoretic foundations of normal logic programs
- On homeostatic behavior of dynamic deductive data bases
- 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
- 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
- Direct encoding of declare constraints in ASP
- Symmetric linear arc monadic Datalog and gadget reductions
- Symmetric linear arc monadic Datalog and gadget reductions
- Negation in rule-based database languages: A survey
- Equivalence issues in abduction and induction
- Rewriting queries using views in the presence of arithmetic comparisons
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 Q3477931)
