Sciweavers

103 search results - page 8 / 21
» Context logic and tree update
Sort
View
LICS
2002
IEEE
15 years 2 months ago
Monadic Queries over Tree-Structured Data
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widesprea...
Georg Gottlob, Christoph Koch
IPL
2002
117views more  IPL 2002»
14 years 9 months ago
Complexity of weak acceptance conditions in tree automata
Weak acceptance conditions for automata on infinite words or trees are defined in terms of the set of states that appear in the run. This is in contrast with, more usual, strong c...
Jakub Neumann, Andrzej Szepietowski, Igor Walukiew...
AIEDAM
1999
79views more  AIEDAM 1999»
14 years 9 months ago
An algorithmic approach to knowledge evolution
Intelligent agents must update their knowledge base as they acquire new information about their environment. The modal logic S5n has been designed for representing knowledge bases...
Alessio Lomuscio, Mark Ryan
111
Voted
JAIR
2008
173views more  JAIR 2008»
14 years 9 months ago
Computational Logic Foundations of KGP Agents
This paper presents the computational logic foundations of a model of agency called the KGP (Knowledge, Goals and Plan) model. This model allows the specification of heterogeneous...
Antonis C. Kakas, Paolo Mancarella, Fariba Sadri, ...
LFCS
2007
Springer
15 years 3 months ago
Total Public Announcements
We present a dynamic epistemic logic for knowledge change of rational agents. Existing approaches only deal with partial public announcements, that means an announcement may lead ...
David Steiner, Thomas Studer