Negation in rule-based database languages: A survey

DOI10.1016/0304-3975(51)90003-5MaRDI QIDQ753476zbMATH OpenOpenAlexFDO

Authors Nicole Bidoit

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

zbMATH Keywords

logic programs with negationrule-based query languages

Mathematics Subject Classification ID

Theory of programming languages (68N15) Logic programming (68N17) Database theory (68P15) Logic in artificial intelligence (68T27)

Recommendations

• Rule-based languages
• Publication:5750391
• scientific article; zbMATH DE number 4147465
• scientific article; zbMATH DE number 4199653
• Negation and minimality in disjunctive databases

Cites work

• scientific article; zbMATH DE number 3646330 (Why is no real title available?)
• scientific article; zbMATH DE number 4180775 (Why is no real title available?)
• scientific article; zbMATH DE number 3874667 (Why is no real title available?)
• scientific article; zbMATH DE number 4199654 (Why is no real title available?)
• scientific article; zbMATH DE number 4147465 (Why is no real title available?)
• scientific article; zbMATH DE number 4147557 (Why is no real title available?)
• scientific article; zbMATH DE number 4155872 (Why is no real title available?)
• scientific article; zbMATH DE number 3976991 (Why is no real title available?)
• scientific article; zbMATH DE number 3982556 (Why is no real title available?)
• scientific article; zbMATH DE number 4106296 (Why is no real title available?)
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 3466489 (Why is no real title available?)
• scientific article; zbMATH DE number 3467028 (Why is no real title available?)
• scientific article; zbMATH DE number 3474957 (Why is no real title available?)
• scientific article; zbMATH DE number 3607517 (Why is no real title available?)
• scientific article; zbMATH DE number 3640922 (Why is no real title available?)
• scientific article; zbMATH DE number 1142327 (Why is no real title available?)
• scientific article; zbMATH DE number 4185010 (Why is no real title available?)
• scientific article; zbMATH DE number 4185011 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• A Computing Procedure for Quantification Theory
• A basis for deductive database systems
• A basis for deductive database systems II
• A kripke-kleene semantics for logic programs*
• A lattice-theoretical fixpoint theorem and its applications
• A logic for default reasoning
• A procedural semantics for well-founded negation in logic programs
• A relational model of data for large shared data banks
• Autoepistemic logic
• Circumscription - a form of non-monotonic reasoning
• Closed-world databases and circumscription
• Closures and fairness in the semantics of programming logic
• Computable queries for relational data bases
• Contributions to the Theory of Logic Programming
• Datalog extensions for database queries and updates
• Extended algebra and calculus for nested relational databases
• General logical databases and programs: Default logic semantics and stratification
• Horn clause queries and generalizations
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Logic programming with sets
• Minimalism, justification and non-monotonicity in deductive databases
• Monotone versus positive
• Negation as inconsistency. I
• Negation by default and unstratifiable logic programs
• Negation in logic programming
• Negation in rule-based database languages: A survey
• Non first normal form relations: An algebra allowing data restructuring
• Non-monotonic logic. I
• On the relation between default and autoepistemic logic
• Optimal fixedpoints of logic programs
• Relational queries computable in polynomial time
• Saturation, nonmonotonic reasoning and the closed-world assumption
• Semantical considerations on nonmonotonic logic
• Structure and complexity of relational queries
• The Semantics of Predicate Logic as a Programming Language
• The expressive power of stratified logic programs
• Why not negation by fixpoint?

Cited in

(18)

• Negation in rule-based database languages: A survey
• Revision by communication
• A mechanism of function calls in MSVL
• Operational semantics of Framed Tempura
• CWA formalizations in multi-valued logics
• Foundations of Rule-Based Query Answering
• Tie-breaking semantics and structural totality
• The expressive powers of stable models for bound and unbound DATALOG queries
• Boolean lattices of nested relations as a foundation for rule-based database languages
• An extended constraint deductive database: theory and implementation
• Answer Set Programming: A Primer
• IsaLog¬: a deductive language with negation for complex-object databases with hierarchies
• Is there an axiomatic semantics for standard pure Prolog?
• Recovery of (non)monotonic theories
• Revising and updating using a back-up semantics
• Update rules in Datalog programs
• Expressive power and complexity of partial models for disjunctive deductive databases
• A temporal programming model with atomic blocks based on projection temporal logic

This page was built for publication: Negation in rule-based database languages: A survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753476)