Sciweavers

834 search results - page 10 / 167
» Computing Minimal Models, Stable Models, and Answer Sets
Sort
View
LPNMR
2011
Springer
14 years 2 months ago
Communicating ASP and the Polynomial Hierarchy
Communicating answer set programming is a framework to represent and reason about the combined knowledge of multiple agents using the idea of stable models. The semantics and expre...
Kim Bauters, Steven Schockaert, Dirk Vermeir, Mart...
JAIR
2007
121views more  JAIR 2007»
14 years 11 months ago
On the Semantics of Logic Programs with Preferences
This work is a contribution to prioritized reasoning in logic programming in the presence of preference relations involving atoms. The technique, providing a new interpretation fo...
Sergio Greco, Irina Trubitsyna, Ester Zumpano
88
Voted
IROS
2008
IEEE
106views Robotics» more  IROS 2008»
15 years 6 months ago
Visual servoing from two special compounds of features using a spherical projection model
— This paper is concerned with the use of a spherical projection model to design optimal visual features for visual servoing. Here two special targets are considered: a sphere ma...
Romeo Tatsambon Fomena, François Chaumette
96
Voted
ICTAC
2004
Springer
15 years 5 months ago
Minimal Spanning Set for Coverage Testing of Interactive Systems
A model-based approach for minimization of test sets for interactive systems is introduced. Test cases are efficiently generated and selected to cover the behavioral model and the ...
Fevzi Belli, Christof J. Budnik
110
Voted
AAAI
2006
15 years 1 months ago
Fast SAT-based Answer Set Solver
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
Zhijun Lin, Yuanlin Zhang, Hector Hernandez