Sciweavers

1864 search results - page 55 / 373
» Formal topology and domains
Sort
View
INFORMATICALT
2010
103views more  INFORMATICALT 2010»
13 years 9 months ago
Formal Correctness Proof for DPLL Procedure
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ļ...
Filip Maric, Predrag Janicic
DLOG
2009
13 years 9 months ago
Formalizing Multimedia Interpretation based on Abduction over Description Logic Aboxes
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...
GEOINFORMATICA
2008
123views more  GEOINFORMATICA 2008»
13 years 11 months ago
Efficient Implementation Techniques for Topological Predicates on Complex Spatial Objects
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...
Reasey Praing, Markus Schneider
SMC
2007
IEEE
14 years 5 months ago
Evaluation of representations in AI problem solving
Abstract ā€“ We formalize the concept of domain representation in artiļ¬cial intelligence, and propose a framework for evaluating representation and comparing alternative represen...
Eugene Fink
LPKR
1997
Springer
14 years 3 months ago
Reasoning with Prioritized Defaults
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...
Michael Gelfond, Tran Cao Son