Pages that link to "Item:Q3706528"
From MaRDI portal
The following pages link to Horn clause queries and generalizations (Q3706528):
Displaying 50 items.
- Decidable containment of recursive queries (Q555766) (← 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)
- Monotonic aggregation in deductive databases (Q676422) (← links)
- The alternating fixpoint of logic programs with negation (Q686646) (← links)
- A closed-form evaluation for Datalog queries with integer (gap)-order constraints (Q688670) (← links)
- Negation in rule-based database languages: A survey (Q753476) (← links)
- Negation by default and unstratifiable logic programs (Q753501) (← links)
- The expressive power of stratified logic programs (Q803773) (← links)
- Domain-independent formulas and databases (Q1092679) (← links)
- Inferring negative information from disjunctive databases (Q1114440) (← links)
- On the relationship between circumscription and negation as failure (Q1115207) (← links)
- Stratification and knowledge base management (Q1122994) (← links)
- Circumscribing DATALOG: expressive power and complexity (Q1127538) (← links)
- General logical databases and programs: Default logic semantics and stratification (Q1173955) (← links)
- On the representation and querying of sets of possible worlds (Q1174717) (← links)
- Datalog extensions for database queries and updates (Q1176285) (← links)
- Why not negation by fixpoint? (Q1176286) (← links)
- On the expressive power of database queries with intermediate types (Q1176290) (← links)
- A comparison between algebraic query languages for flat and nested databases (Q1177142) (← links)
- Three-valued nonmonotonic formalisms and semantics of logic programs (Q1182168) (← links)
- Capturing complexity classes by fragments of second-order logic (Q1193408) (← links)
- The powerset algebra as a natural tool to handle nested database relations (Q1198662) (← links)
- The parallel complexity of single rule logic programs (Q1202885) (← links)
- A transformation system for deductive database modules with perfect model semantics (Q1208734) (← links)
- Stratified least fixpoint logic (Q1331926) (← links)
- Default theories that always have extensions (Q1337686) (← links)
- Querying disjunctive databases through nonmonotonic logics (Q1350535) (← links)
- The expressive powers of stable models for bound and unbound DATALOG queries (Q1362337) (← links)
- Bounded arity Datalog \((\neq)\) queries on graphs (Q1376404) (← links)
- Polynomial-time computable stable models (Q1380428) (← links)
- Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
- Bounds in the propagation of selection into logic programs (Q1813949) (← links)
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic (Q1919531) (← links)
- On the computational cost of disjunctive logic programming: Propositional case (Q1924780) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Video model for dynamic objects (Q2509209) (← links)
- Arity hierarchies (Q2563982) (← links)
- Symbioses between mathematical logic and computer science (Q2630825) (← links)
- Strategy of searching of a conclusion in Horn clauses with unitary consideration of sub-target (Q2760517) (← links)
- Existential Fixed-Point Logic, Universal Quantifiers, and Topoi (Q3585999) (← links)
- One Useful Logic That Defines Its Own Truth (Q3599112) (← links)
- On the impact of stratification on the complexity of nonmonotonic reasoning (Q4317728) (← links)
- (Q4499256) (← links)
- An analysis of the Core-ML language: Expressive power and type reconstruction (Q4632418) (← links)
- Complexity and expressive power of second‐order extended Horn logic (Q4915214) (← links)
- Infinitary logic for computer science (Q5204339) (← links)
- A Theoretical Framework for the Declarative Debugging of Datalog Programs (Q5504584) (← links)
- On the expressibility and the computability of untyped queries (Q5936000) (← links)
