Sciweavers

4401 search results - page 33 / 881
» Computing with Default Logic
Sort
View
TARK
2009
Springer
14 years 3 months ago
Logical omniscience as a computational complexity problem
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
Sergei N. Artëmov, Roman Kuznets
ATAL
2005
Springer
14 years 2 months ago
Semantics of declarative goals in agent programming
This paper addresses the notion of declarative goals as used in agent programming. Declarative goals describe desirable states, and semantics of these goals in an agent programmin...
Birna van Riemsdijk, Mehdi Dastani, John-Jules Ch....
ECAI
2010
Springer
13 years 9 months ago
Optimal Tableaux for Conditional Logics with Cautious Monotonicity
Conditional logics capture default entailment in a modal framework in which non-monotonic implication is a first-class citizen, and in particular can be negated and nested. There i...
Lutz Schröder, Dirk Pattinson, Daniel Hausman...
TARK
2005
Springer
14 years 2 months ago
Semantics for multi-agent only knowing: extended abstract
s for Multi-Agent Only Knowing (extended abstract) Arild Waaler1,2 and Bjørnar Solhaug3,4 1 Finnmark College, Norway 2 Dep. of Informatics, University of Oslo, Norway 3 SINTEF ICT...
Arild Waaler, Bjørnar Solhaug
FOSSACS
2004
Springer
14 years 2 months ago
Soft lambda-Calculus: A Language for Polynomial Time Computation
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affi...
Patrick Baillot, Virgile Mogbil