๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the satisfiability of circumscription

โœ Scribed by Vladimir Lifschitz

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
476 KB
Volume
28
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

โœฆ Synopsis

Etherington, Mercer and Reiter showed, on the basis of ideas of Bossu and Siegel, that circumscription cannot lead to inconsistency for universal formulas. We extend this result in three directions: to formulas of a more general syntactic form, to circumscr~tion with some predicate symbols allowed to vary. and to prioritized circumscription.

๐Ÿ“œ SIMILAR VOLUMES

A theorem on the consistency of circumsc
A theorem on the consistency of circumscription
โœ Peter L. Mott ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 536 KB

This paper giw's more general conditions under which McCarthy's circumscription is consistent, allowing application of the method outside the domain of universal sentences. It is shown that circumscription as presented here continues to correspond to the semantic model of minimization. Some applicat

On the relationship between circumscript
On the relationship between circumscription and negation as failure
โœ Michael Gelfond; Halina Przymusinska; Teodor Przymusinski ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 940 KB

The aim of this paper is to investigate two powerful methods of handling negative information in logic-based knowledge representation systems: the logical minimization in the form of circumscription and the negation as failure rule, formalized by various closures (or completions) of original theorie

The importance of open and recursive cir
The importance of open and recursive circumscription
โœ Philippe Besnard; Yves Moinard; Robert E. Mercer ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 485 KB

Circumscription is known to result in an inconsistency when applied to certain consistent theories. To counter this problem, closed nonrecursive circumscription, a restricted form of circumscription that has been proved not to affect the consistency of the theory over which circumscription is applie

On the Query Complexity of Clique Size a
On the Query Complexity of Clique Size and Maximum Satisfiability
โœ Richard Chang ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 682 KB

This paper explores the bounded query complexity of approximating the size of the maximum clique in a graph (Clique Size) and the number of simultaneously satisfiable clauses in a 3CNF formula (MaxSat). The results in the paper show that for certain approximation factors, approximating Clique Size a