The DPLL procedure for the SAT problem is one of the fundamental algorithms in computer science, with many applications in a range of domains, including software and hardware veriļ...
Abstract. The paper describes how interpretations of multimedia documents can be formally derived using abduction over domain knowledge represented in an ontology. The approach use...
Irma Sofia Espinosa Peraldi, Atila Kaya, Ralf M&ou...
Topological relationships like overlap, inside, meet, and disjoint uniquely characterize the relative position between objects in space. For a long time, they have been a focus of...
Abstract ā We formalize the concept of domain representation in artiļ¬cial intelligence, and propose a framework for evaluating representation and comparing alternative represen...
The purpose of this paper is to investigate the methodology of reasoning with prioritized defaults in the language of logic programs under the answer set semantics. We present a do...