711 search results - page 19 / 143 » Modal Logics are Coalgebraic |
DLOG
2007
15 years 8 days ago
2007
We present a query answering technique based on notions and results from modal Correspondence Theory. It allows us to answer a wide family of conjunctive queries by polynomial redu...
APAL
2007
14 years 10 months ago
2007
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
KI
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
101
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Finite trace semantics is known and well understood for classical automata and non-deterministic labelled transition systems. Jacobs et al introduced a more general definition fo...
IJCAI
1997
14 years 11 months ago
1997
In the paper, we consider the problem of supporting automated reasoning in a large class of knowledge representation formalisms, including terminological and epistemic logics, who...