Horn clause queries and generalizations
From MaRDI portal
Publication:3706528
DOI10.1016/0743-1066(85)90002-0zbMath0583.68058OpenAlexW1998162300MaRDI QIDQ3706528
Publication date: 1985
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0743-1066(85)90002-0
Related Items
Stratified least fixpoint logic, Default theories that always have extensions, Domain-independent formulas and databases, Symbioses between mathematical logic and computer science, Querying disjunctive databases through nonmonotonic logics, The expressive powers of stable models for bound and unbound DATALOG queries, Inferring negative information from disjunctive databases, On the relationship between circumscription and negation as failure, Bounded arity Datalog \((\neq)\) queries on graphs, Hierarchies in transitive closure logic, stratified Datalog and infinitary logic, Stratification and knowledge base management, Polynomial-time computable stable models, Circumscribing DATALOG: expressive power and complexity, On the computational cost of disjunctive logic programming: Propositional case, On the impact of stratification on the complexity of nonmonotonic reasoning, General logical databases and programs: Default logic semantics and stratification, On the representation and querying of sets of possible worlds, Datalog extensions for database queries and updates, Why not negation by fixpoint?, On the expressive power of database queries with intermediate types, A comparison between algebraic query languages for flat and nested databases, An analysis of the Core-ML language: Expressive power and type reconstruction, Three-valued nonmonotonic formalisms and semantics of logic programs, Comparison of functional and predicative query paradigms, Tie-breaking semantics and structural totality, On the equivalence of recursive and nonrecursive Datalog programs, Monotonic aggregation in deductive databases, Capturing complexity classes by fragments of second-order logic, The powerset algebra as a natural tool to handle nested database relations, The alternating fixpoint of logic programs with negation, Complexity and expressive power of second‐order extended Horn logic, A closed-form evaluation for Datalog queries with integer (gap)-order constraints, The parallel complexity of single rule logic programs, A transformation system for deductive database modules with perfect model semantics, On the expressibility and the computability of untyped queries, Existential Fixed-Point Logic, Universal Quantifiers, and Topoi, Decidable containment of recursive queries, Semantics and expressive power of nondeterministic constructs in deductive databases, One Useful Logic That Defines Its Own Truth, Video model for dynamic objects, Infinitary logic for computer science, Bounds in the propagation of selection into logic programs, Negation in rule-based database languages: A survey, Negation by default and unstratifiable logic programs, Arity hierarchies, A Theoretical Framework for the Declarative Debugging of Datalog Programs, Conjunctive-query containment and constraint satisfaction, Backdoors to tractable answer set programming, The expressive power of stratified logic programs
