74 search results - page 4 / 15 » The Complexity of Reasoning for Fragments of Autoepistemic L... |
119
click to vote
TIME
2003
IEEE
15 years 4 months ago
2003
IEEE
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
98
Voted
DLOG
2003
15 years 1 months ago
2003
In this paper we introduce a decidable fixpoint extension of temporal Description Logics. We exploit the decidability results obtained for various monodic extensions of Descripti...
85
Voted
AAAI
1990
15 years 24 days ago
1990
Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. We present a detailed analysis of the comp...
CMOT
1998
14 years 11 months ago
1998
A programming language which is optimized for modelling multi-agent interaction within articulated social structures such as organizations is described with several examples of it...
LPAR
2007
Springer
15 years 5 months ago
2007
Springer
We investigate the possibility of developing a decidable logic which allows expressing a large variety of real world specifications. The idea is to define a decidable subset of m...