Sciweavers

AAAI
2008
14 years 14 hour ago
Efficiently Exploiting Dependencies in Local Search for SAT
We propose a new local search platform that splits a CNF formula into three sub-components: i) a minimal dependency lattice (representing the core connections between logic gates)...
Duc Nghia Pham, John Thornton, Abdul Sattar
AAAI
2007
14 years 14 hour ago
Topological Mapping with Weak Sensory Data
In this paper, we consider the exploration of topological environments by a robot with weak sensory capabilities. We assume only that the robot can recognize when it has reached a...
Gregory Dudek, Dimitri Marinakis
AAAI
2008
14 years 14 hour ago
Hyperequivalence of Logic Programs with Respect to Supported Models
Recent research in nonmonotonic logic programming has focused on program equivalence relevant for program optimization and modular programming. So far, most results concern the st...
Miroslaw Truszczynski, Stefan Woltran
AAAI
2007
14 years 14 hour ago
An Experimental Comparison of Constraint Logic Programming and Answer Set Programming
Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative programming paradigms that have been extensively used to encode ap...
Agostino Dovier, Andrea Formisano, Enrico Pontelli
AAAI
2008
14 years 14 hour ago
GLADDER: Combining Gesture and Geometric Sketch Recognition
Sketch recognition systems usually recognize strokes either as stylistic gestures or geometric shapes. Both techniques have their advantages. This paper presents a method for inte...
Paul Corey, Tracy Hammond
AAAI
2007
14 years 14 hour ago
Optimal Regression for Reasoning about Knowledge and Actions
Hans P. van Ditmarsch, Andreas Herzig, Tiago De Li...
AAAI
2007
14 years 14 hour ago
Relationship Identification for Social Network Discovery
Christopher P. Diehl, Galileo Namata, Lise Getoor
AAAI
2007
14 years 14 hour ago
Using More Reasoning to Improve #SAT Solving
Jessica Davies, Fahiem Bacchus