251 search results - page 33 / 51 » Finite Model Reasoning in Description Logics |
LPNMR
2001
Springer
13 years 11 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 ...
ILP
2007
Springer
14 years 1 months ago
2007
Springer
The management of business processes has recently received a lot of attention. One of the most interesting problems is the description of a process model in a language that allows ...
CHI
2004
ACM
14 years 7 months ago
2004
ACM
In this paper we report a new approach to generating predictions about skilled interactive cognition. The approach, which we call Cognitive Constraint Modeling, takes as input a d...
ER
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. The alignment of different ontologies requires the specification, representation and execution of translation rules. The rules need to integrate translations at the lexic...
FORTE
2004
13 years 8 months ago
2004
Witnesses and counterexamples produced by model checkers provide a very useful source of diagnostic information. They are usually returned in the form of a single computation path ...