Sciweavers

77 search results - page 4 / 16
» Reasoning by Cases without Contraposition in Default Logic
Sort
View
CSL
2010
Springer
13 years 8 months ago
The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
Barnaby Martin, Jos Martin
KI
1995
Springer
13 years 11 months ago
What Is a Skeptical Proof?
Abstract. We investigate the task of skeptically reasoning in extensionbased, nonmonotonic logics by concentrating on general argumentation theories. The restricted applicability o...
Michael Thielscher
JELIA
2004
Springer
14 years 27 days ago
Logic Programs with Functions and Default Values
In this work we reconsider the replacement of predicate-like notation by functional terms, using a similar syntax to Functional Logic Programming, but under a completely different...
Pedro Cabalar, David Lorenzo
KR
1994
Springer
13 years 11 months ago
Toward a Logic for Qualitative Decision Theory
We present a logic for representing and reasoning with qualitative statements of preference and normality and describe how these may interact in decision making under uncertainty....
Craig Boutilier
DAARC
2007
Springer
137views Algorithms» more  DAARC 2007»
14 years 1 months ago
Anaphora Resolution as Equality by Default
The resolution of anaphora is dependent on a number of factors discussed in the literature: syntactic parallelism, topicality, etc. A system that attempts to resolve anaphora will ...
Ariel Cohen