Abstract. Today, different formalisms exist to solve reasoning problems under uncertainty. For most of the known formalisms, corresponding computer implementations are available. ...
Absorptions are generally employed in Description Logics (DL) reasoners in a uniform way regardless of the structure of an input knowledge base. In this paper we present an approac...
Techniques for computation on generalized diagrams are defined and the KM implications are explored. Descriptive Computing is presented and plan computation based on world models t...
This work discusses two non-traditional approaches for evaluating the imprecision of static analysis. The approaches are based on proofs of feasibility or infeasibility that are c...
Model checking of temporal logic has already been proposed for automatic planning. In this paper, we introduce a simple adaptation of the ATL model checking algorithm that returns ...