Negation in rule-based database languages: A survey
From MaRDI portal
Publication:753476
DOI10.1016/0304-3975(51)90003-5zbMath0716.68025OpenAlexW2091849010MaRDI QIDQ753476
Publication date: 1991
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(51)90003-5
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (15)
A temporal programming model with atomic blocks based on projection temporal logic ⋮ Operational semantics of Framed Tempura ⋮ The expressive powers of stable models for bound and unbound DATALOG queries ⋮ A mechanism of function calls in MSVL ⋮ Update rules in datalog programs ⋮ Revision by communication ⋮ An extended constraint deductive database: theory and implementation ⋮ Tie-breaking semantics and structural totality ⋮ CWA formalizations in multi-valued logics ⋮ Negation in rule-based database languages: A survey ⋮ Answer Set Programming: A Primer ⋮ Expressive power and complexity of partial models for disjunctive deductive databases ⋮ Recovery of (non)monotonic theories ⋮ Revising and updating using a back-up semantics ⋮ Is there an axiomatic semantics for standard pure Prolog?
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non first normal form relations: An algebra allowing data restructuring
- Negation in rule-based database languages: A survey
- Negation by default and unstratifiable logic programs
- Closures and fairness in the semantics of programming logic
- The expressive power of stratified logic programs
- Logic programming with sets
- Saturation, nonmonotonic reasoning and the closed-world assumption
- Semantical considerations on nonmonotonic logic
- Optimal fixedpoints of logic programs
- Closed-world databases and circumscription
- On the relation between default and autoepistemic logic
- Minimalism, justification and non-monotonicity in deductive databases
- A logic for default reasoning
- Circumscription - a form of non-monotonic reasoning
- Non-monotonic logic. I
- Computable queries for relational data bases
- General logical databases and programs: Default logic semantics and stratification
- Datalog extensions for database queries and updates
- Why not negation by fixpoint?
- Structure and complexity of relational queries
- A lattice-theoretical fixpoint theorem and its applications
- A basis for deductive database systems
- Horn clause queries and generalizations
- A kripke-kleene semantics for logic programs*
- A basis for deductive database systems II
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Negation as inconsistency. I
- Relational queries computable in polynomial time
- Monotone versus positive
- Negation in logic programming
- Extended algebra and calculus for nested relational databases
- Contributions to the Theory of Logic Programming
- A procedural semantics for well-founded negation in logic programs
- The Semantics of Predicate Logic as a Programming Language
- Autoepistemic logic
- A relational model of data for large shared data banks
- A Computing Procedure for Quantification Theory
This page was built for publication: Negation in rule-based database languages: A survey