322 search results - page 29 / 65 » Practical Reasoning for Expressive Description Logics |
DLOG
2001
14 years 11 months ago
2001
Description logics have been designed and studied in a modular way. This has allowed a methodic approach to complexity evaluation. We present a way to preserve this modularity in ...
103
click to vote
TPHOL
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract. We present a comprehensive set of tactics that make it practical to use separation logic in a proof assistant. These tactics enable the verification of partial correctne...
124
click to vote
AAAI
2010
14 years 11 months ago
2010
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractab...
80
Voted
CADE
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Pocket KRHyper is a reasoning system for Java-enabled mobile devices. The core of the system is a first order theorem prover and model generator based on the hyper table...
LPNMR
2001
Springer
15 years 1 months ago
2001
Springer
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...