738 search results - page 69 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
SEMWEB
2007
Springer
15 years 3 months ago
2007
Springer
Abstract Traditional ontology mapping techniques are not strictly applicable in a dynamic and distributed environment (e.g. P2P and pervasive computing) in which on-the-fly alignm...
PADS
2003
ACM
15 years 3 months ago
2003
ACM
In distributed simulations, such as multi-player distributed virtual environments (DVE), power consumption traditionally has not been a major design factor. However, emerging batt...
AAAI
1998
14 years 11 months ago
1998
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...
INFORMATICALT
2006
14 years 9 months ago
2006
This paper discusses the determination of the spare inventory level for a multiechelon repairable item inventory system, which has several bases and a central depot with emergency ...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...