2490 search results - page 250 / 498 » Complexity of Contextual Reasoning |
199
click to vote
DLOG
2007
15 years 8 months ago
2007
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...
141
click to vote
DEON
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Logical architectures combine several logics into a more complex logical system. In this paper we study a logical architecture using input/output operations corresponding...
142
click to vote
DEON
2006
Springer
15 years 8 months ago
2006
Springer
In this paper we reconsider the definition of counts-as relations in normative multiagent systems: counts-as relations do not always provide directly act interpretation of brute fa...
198
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
157
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
Infinite-state automata are a new invention: they are automata that have an infinite number of states represented by words, transitions defined using rewriting, and with sets of in...