Sciweavers

1071 search results - page 143 / 215
» Modal Logics, Description Logics and Arithmetic Reasoning
Sort
View
TPCD
1994
157views Hardware» more  TPCD 1994»
14 years 11 months ago
Non-Restoring Integer Square Root: A Case Study in Design by Principled Optimization
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-...
John W. O'Leary, Miriam Leeser, Jason Hickey, Mark...
LICS
2006
IEEE
15 years 3 months ago
The Boundedness Problem for Monadic Universal First-Order Logic
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...
Martin Otto
DLOG
2003
14 years 11 months ago
Rule Based Computation of Updates to Terminologies
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...
Sanjay Modgil
MKWI
2008
190views Business» more  MKWI 2008»
14 years 11 months ago
Partial Matchmaking for complex Product and Service Descriptions
: 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...
Heiner Stuckenschmidt, Martin Kolb
DLOG
1998
14 years 11 months ago
Combining Expression and Content in Domains for Dialog Managers
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...
Bernd Ludwig, Günther Görz, Heinrich Nie...