The following pages link to (Q3477931):
Displaying 50 items.
- Semi-equilibrium models for paracoherent answer set programs (Q253992) (← links)
- Decidable containment of recursive queries (Q555766) (← links)
- A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs (Q672662) (← links)
- Conjunctive query containment with respect to views and constraints (Q672739) (← links)
- Combining explicit negation and negation by failure via Belnap's logic (Q673380) (← links)
- Comparison of functional and predicative query paradigms (Q676417) (← links)
- Tie-breaking semantics and structural totality (Q676419) (← links)
- On the equivalence of recursive and nonrecursive Datalog programs (Q676421) (← links)
- Knowledgebase transformations (Q676426) (← links)
- The alternating fixpoint of logic programs with negation (Q686646) (← links)
- Logical query optimization by proof-tree transformation (Q686647) (← links)
- A logic for reasoning with inconsistency (Q688558) (← links)
- Low-complexity aggregation in GraphLog and Datalog (Q688669) (← links)
- Negation in rule-based database languages: A survey (Q753476) (← links)
- Equivalence issues in abduction and induction (Q833733) (← links)
- Rewriting queries using views in the presence of arithmetic comparisons (Q859842) (← links)
- Boundedness is undecidable for datalog programs with a single recursive rule (Q1123647) (← links)
- Circumscribing DATALOG: expressive power and complexity (Q1127538) (← links)
- Datalog extensions for database queries and updates (Q1176285) (← links)
- Semantics of Horn and disjunctive logic programs (Q1177928) (← links)
- How complicated is the set of stable models of a recursive logic program? (Q1192346) (← links)
- The parallel complexity of single rule logic programs (Q1202885) (← links)
- Verifying local stratifiability of logic programs and databases (Q1205177) (← links)
- Preservation of integrity constraints in definite DATALOG programs (Q1208438) (← links)
- Paraconsistent logic programming (Q1262746) (← links)
- Combining Horn rules and description logics in CARIN (Q1274681) (← links)
- Sequences, datalog, and transducers (Q1278034) (← links)
- A semantics for a class of non-deterministic and causal production system programs (Q1340964) (← links)
- An incremental concept formation approach for learning from databases (Q1341713) (← links)
- The expressive powers of stable models for bound and unbound DATALOG queries (Q1362337) (← links)
- On the complexity of single-rule datalog queries. (Q1401945) (← links)
- Stratified resolution (Q1404977) (← links)
- Safe inductions and their applications in knowledge representation (Q1647517) (← links)
- Certifying standard and stratified Datalog inference engines in SSReflect (Q1687733) (← links)
- Magic sets for disjunctive Datalog programs (Q1761296) (← links)
- Logic programs, iterated function systems, and recurrent radial basis function networks (Q1884270) (← links)
- On the computational cost of disjunctive logic programming: Propositional case (Q1924780) (← links)
- Inductive general game playing (Q2203324) (← links)
- Copy complexity of Horn formulas with respect to unit read-once resolution (Q2235734) (← links)
- Complexity results for probabilistic answer set programming (Q2302961) (← links)
- To Vladimir Lifschitz on His 65th Birthday (Q2900498) (← links)
- The rise and fall of semantic rule updates based on<tt>SE</tt>-models (Q2933088) (← links)
- Modular Paracoherent Answer Sets (Q2938513) (← links)
- Eliminating Recursion from Monadic Datalog Programs on Trees (Q2946356) (← links)
- COMPUTING THE WELL-FOUNDED MODEL OF DEDUCTIVE DATABASES (Q3114457) (← links)
- (Q3348437) (← links)
- $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols (Q3498490) (← links)
- Logic Programming Languages for Databases and the Web (Q3578396) (← links)
- Answer Set Programming: A Primer (Q3638997) (← links)
- (Q4286742) (← links)
