10568 search results - page 195 / 2114 » Computer Intelligence and Formalization |
103
click to vote
ECAI
2004
Springer
15 years 6 months ago
2004
Springer
We introduce a uniform approach of representing a variety of paraconsistent non-monotonic formalisms by quantified Boolean formulae (QBFs) in the context of four-valued semantics. ...
108
click to vote
DALT
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. This paper presents a complete temporal STIT logic for reasoning about multi-agency. I discuss its application for reasoning about norms, knowledge, autonomy, and other m...
130
click to vote
JELIA
2010
Springer
15 years 25 days ago
2010
Springer
In the field of non-monotonic logics, the notion of rational closure is acknowledged as a landmark, and we are going to see that such a construction can be characterised by means o...
130
click to vote
ICAIL
2011
ACM
14 years 2 months ago
2011
ACM
We study the formal relationships between the inferential aspects of Carneades (a general argumentation framework) and Defeasible Logic. The outcome of the investigation is that t...
111
Voted
CHI
2008
ACM
16 years 3 months ago
2008
ACM
Current object group selection techniques such as lasso or rectangle selection can be time consuming and error prone. This is apparent when selecting distant objects on a large di...