1071 search results - page 143 / 215 » Modal Logics, Description Logics and Arithmetic Reasoning |
116
click to vote
TPCD
1994
15 years 1 months ago
1994
Theorem proving techniques are particularly well suited for reasoning about arithmetic above the bit level and for relating di erent f abstraction. In this paper we show how a non-...
113
click to vote
LICS
2006
IEEE
15 years 5 months ago
2006
IEEE
We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula ϕ(X, x), positive in X, decide whether there is a unif...
DLOG
2003
15 years 1 months ago
2003
In this paper we formalise compilation of the conjunctive bodies of a restricted class of Horn rules into updates on terminologies. This involves a pre-processing of the graphs re...
111
click to vote
MKWI
2008
15 years 1 months ago
2008
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...
101
click to vote
DLOG
1998
15 years 1 months ago
1998
We present work in progress on abstracting dialog managers from their domain in order to implement a dialog manager development tool which takes (among other data) a domain descri...