Sciweavers

17 search results - page 2 / 4
» A Complete and Decidable Logic for Resource-Bounded Agents
Sort
View
AAAI
1990
13 years 8 months ago
Decidable Reasoning in First-Order Knowledge Bases with Perfect Introspection
Since knowledge bases (KBs) are usually incomplete, they should be able to provide information regarding their own incompleteness, which requires them to introspect on what they k...
Gerhard Lakemeyer
AIML
2008
13 years 9 months ago
Undecidability for arbitrary public announcement logic
Arbitrary public announcement logic (APAL) is an extension of multi-agent epistemic logic that allows agents' knowledge states to be updated by the public announcement of (pos...
Tim French, Hans P. van Ditmarsch
ATAL
1997
Springer
13 years 11 months ago
Approximate Reasoning about Combined Knowledge
Abstract. Just as cooperation in multi-agent systems is a central issue for solving complex tasks, so too is the ability for an intelligent agent to reason about combined knowledge...
Frédéric Koriche
INFORMATICALT
2007
111views more  INFORMATICALT 2007»
13 years 7 months ago
Sequent Calculi for Branching Time Temporal Logics of Knowledge and Belief
In this paper we consider branching time temporal logics of knowledge and belief. These logics involve the discrete time linear temporal logic operators “next” and “until” ...
Jurate Sakalauskaite
TARK
2009
Springer
14 years 1 months ago
A logic of propositional control for truthful implementations
We introduce a logic designed to support reasoning about social choice functions. The logic includes operators to capture strategic ability, and operators to capture agent prefere...
Nicolas Troquard, Wiebe van der Hoek, Michael Wool...