3047 search results - page 81 / 610 » On the Meaning of Logical Completeness |
LOGCOM
2000
13 years 10 months ago
2000
Several calculi of objects have been studied in the recent literature, that support the central features of object-based languages: messages, inheritance, dynamic dispatch, object...
WISE
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. Answering a query over a group of RDF data pages is a trivial process. However, in the Semantic Web, there is a need for ontology technology. Consequently, OWL, a family ...
BIRTHDAY
2005
Springer
14 years 4 months ago
2005
Springer
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
ECAI
2010
Springer
14 years 1 days ago
2010
Springer
Abstract. We investigate the problem of the verification of multiagent systems by means of parallel algorithms. We present algorithms for CTLK, a logic combining branching time tem...
JELIA
2010
Springer
13 years 8 months 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...