𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the computability of circumscription

✍ Scribed by T. Krishnaprasad

Book ID
113163215
Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
474 KB
Volume
27
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the satisfiability of circumscription
On the satisfiability of circumscription
✍ Vladimir Lifschitz πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 476 KB

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 t

On the computability of Nash equilibria
On the computability of Nash equilibria
✍ Kislaya Prasad πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 763 KB

We present some algorithmic unsolvability and incompleteness results in game theory and discuss their significance. The main theorem presents a class of n-person games, where each player's strategy set is the real line and payoffs are continuous functions, for which there could not possibly exist a

On the computability of equitable divisi
On the computability of equitable divisions
✍ KatarΓ­na CechlΓ‘rovΓ‘; Eva PillΓ‘rovΓ‘ πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 358 KB
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