2035 search results - page 159 / 407 » On the complexity of stratified logics |
160
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong c...
164
click to vote
ASPDAC
2001
ACM
15 years 10 months ago
2001
ACM
We propose a timing optimization technique for a complex finite state machine that consists of not only random logic but also data operators. In such a design, the timing critical...
155
click to vote
DLOG
2007
15 years 8 months ago
2007
Abstract. In this paper, we continue the recently started work on integrating action formalisms with description logics (DLs), by investigating planning in the context of DLs. We p...
169
click to vote
CADE
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
156
click to vote
LOGCOM
2008
15 years 6 months ago
2008
Fibring is a metalogical constructor that permits to combine different logics by operating on their deductive systems under certain natural restrictions, as for example that the t...