Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/first-order-syntactic-characterizations-of-minimal-entailment-domain-f1OOm5TaaM
References (34)
-
(1985)
Computing circunascription -
A. Yahya, L. Henschen (1985)
Deduction in non-Horn databasesJournal of Automated Reasoning, 1
-
R. Lyndon (1951)
Alfred Horn. On sentences which are true of direct unions of algebras. The journal of symbolic logic , vol. 16 (1951), pp. 14–21.Journal of Symbolic Logic, 16
-
Genevieve Bossu, P. Siegel (1985)
Saturation, Nonmonotonic Reasoning and the Closed-World AssumptionArtif. Intell., 25
-
(1989)
Two applications of model-theoretic forcing to Lipski's data bases with incomplete information -
John C. Shepherdson (1988)
Foundations of Deductive Databases and Logic Programming -
Marek A. Suchenek, Rajshekhar Sunderraman (1990)
Methodologies for Intelligence Systems 5 -
M. Suchenek (1987)
Forcing versus Closed World Assumption -
David Etherington, Robert Mercer, R. Reiter (1985)
On the adequacy of predicate circumscription for closed‐world reasoningComputational Intelligence, 1
-
R. Lyndon (1951)
Review: Alfred Horn, On Sentences Which are True of Direct Unions of AlgebrasJournal of Symbolic Logic, 16
-
Cristian Allen (2003)
The Axiom of Choice -
E. Marczewski (1951)
Sur les congruences et les propriétés positives d'algèbres abstraitesColloquium Mathematicum, 2
-
Martin Davis (1980)
The Mathematics of Non-Monotonic ReasoningArtif. Intell., 13
-
R. Lyndon (1959)
PROPERTIES PRESERVED UNDER HOMOMORPHISMPacific Journal of Mathematics, 9
-
R. Reiter (1987)
On Closed World Data Bases -
M. Suchenek (1990)
Applications of Lyndon Homomorphism Theorems to the Theory of Minimal ModelsInt. J. Found. Comput. Sci., 1
-
(1988)
and Sunderraman , Rajshekhar , ' Minimal models for closed world data bases with views ' , in Zbigniew W . Ras ( Ed . ) , Methodologies for Intelligence Systems -
J. Hintikka (1988)
Model minimization —An alternative to circumscriptionJournal of Automated Reasoning, 4
-
M. Suchenek (1988)
Incremental models of updating data bases -
Jack Minker (1982)
Proceedings of 6th Conference on Automated Deduction, LNCS 138 -
W. Weiss (1997)
Fundamentals of Model Theory -
J. Barwise (1977)
An Introduction to First-Order LogicStudies in logic and the foundations of mathematics, 90
-
J. Minker (1987)
On Indefinite Databases and the Closed World Assumption -
David Etherington, Robert Mercer (1987)
Domain circumscription: a reevaluationComputational Intelligence, 3
-
M. Suchenek (1989)
A Syntactic Characterization of Minimal Entailment -
J. McCarthy (1995)
Circumscription: a form of non-monotonic reasoning -
K. Kunen (1987)
Negation in Logic ProgrammingJ. Log. Program., 4
-
(1987)
A semantical approach to non-monotonic logics -
J. Shepherdson (1988)
Negation in Logic Programming -
Marek A. Suchenek, Rajshekhar Sunderraman (1990)
On negative information in deductive data basesJournal of Database Administration, 1
-
J. Barwise, H. Keisler (1977)
Handbook of mathematical logicThe British Journal for the Philosophy of Science, 30
-
M. Suchenek, Rajshekhar Sunderraman (1990)
On Negative Information in Deductive DatabasesJournal of Database Management, 1
-
Keith Clark (1987)
Negation as Failure -
(1951)
Review of paper by A, Horn
- Publisher
- Springer Journals
- Copyright
- Copyright
- Subject
- Computer Science; Mathematical Logic and Formal Languages; Artificial Intelligence; Mathematical Logic and Foundations; Symbolic and Algebraic Manipulation
- ISSN
- 0168-7433
- eISSN
- 1573-0670
- DOI
- 10.1007/BF00881837
- Publisher site
- See Article on Publisher Site
Abstract
This paper investigates a consistent versioncwa s of Reiter's closed-world assumptioncwa. It provides a syntactic characterization of minimal entailment ⊢ min : for every ∨-sentence ϕ and for every ∨-theory Σ,
Journal
Journal of Automated Reasoning – Springer Journals
Published: Dec 10, 2004