Inferring negative information from disjunctive databases

DOI10.1007/BF00297247MaRDI QIDQ1114440zbMATH OpenOpenAlexFDO

Authors Kenneth A. Ross, Rodney W. Topor

Publication date 1988

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00297247

zbMATH Keywords

negationinference ruledeductive databasesclosed world assumptionnegative informationdisjunctive databasesindefinite database

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Mechanization of proofs and logical operations (03B35)

Recommendations

• Rules for inferring negative information from disjunctive databases and deductive databases
• Negation and minimality in disjunctive databases
• Publication:4504012
• On the complexity of data disjunctions.
• Theory and algorithms for disjunctive deductive databases

Cites work

• scientific article; zbMATH DE number 4199656 (Why is no real title available?)
• scientific article; zbMATH DE number 3755910 (Why is no real title available?)
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 4185011 (Why is no real title available?)
• A basis for deductive database systems
• A basis for deductive database systems II
• Computing protected circumscription
• Deduction in non-Horn databases
• Deleting Repeated Goals in the Problem Reduction Format
• Horn clause queries and generalizations
• On the relationship between circumscription and negation as failure
• The Semantics of Predicate Logic as a Programming Language

Cited in

(22)

• Theory and algorithms for disjunctive deductive databases
• Rules for inferring negative information from disjunctive databases and deductive databases
• Prolegomena to logic programming for non-monotonic reasoning
• Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete
• Using clausal deductive databases for defining semantics in disjunctive deductive databases
• Logic programming and reasoning with incomplete information
• Static semantics for normal and disjunctive logic programs
• Paraconsistent disjunctive deductive databases
• Interpreting disjunctive logic programs based on a strong sense of disjunction
• Parsing as non-Horn deduction
• Reasoning under minimal upper bounds in propositional logic
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• An alternative approach to the semantics of disjunctive logic programs and deductive databases
• Stable classes and operator pairs for disjunctive programs
• scientific article; zbMATH DE number 1507287 (Why is no real title available?)
• Introducing negative information in relational databases
• On the computational cost of disjunctive logic programming: Propositional case
• An abductive framework for negation in disjunctive logic programming
• Query evaluation in probabilistic relational databases
• Autoepistemic logic of knowledge and beliefs
• Weak generalized closed world assumption
• Characterizing D-WFS: confluence and iterated GCWA

This page was built for publication: Inferring negative information from disjunctive databases

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