4513 search results - page 243 / 903 » Logic programming with satisfiability |
157
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
By managing network resources at compile time, the compiled communication technique greatly improves the communication performance for communication patterns that are known at com...
115
click to vote
ECAI
2006
Springer
15 years 7 months ago
2006
Springer
Bounding constraints are used to bound the tolerance of solutions under certain undesirable features. Standard solvers propagate them one by one. Often times, it is easy to satisfy...
167
click to vote
JAIR
2012
13 years 6 months ago
2012
Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action for...
139
click to vote
JAIR
1998
15 years 3 months ago
1998
It is common to view programs as a combination of logic and control: the logic part de nes what the program must do, the control part how to do it. The Logic Programming paradigm ...
143
click to vote
ICRA
2005
IEEE
15 years 9 months ago
2005
IEEE
— In this paper, we consider the problem of robot motion planning in order to satisfy formulas expressible in temporal logics. Temporal logics naturally express traditional robot...