648 search results - page 45 / 130 » Using Criticalities as a Heuristic for Answer Set Programmin... |
121
click to vote
ESOP
2006
Springer
15 years 5 months ago
2006
Springer
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...
108
click to vote
LPNMR
2007
Springer
15 years 7 months ago
2007
Springer
In this paper by considering an answer set programming approach and some basic ideas from possibilistic logic, we introduce a possibilistic disjunctive logic programming approach t...
120
click to vote
ASPDAC
1998
ACM
15 years 5 months ago
1998
ACM
— Test Pattern Generation for combinational circuits entails the identification of primary input assignments for detecting each fault in a set of target faults. An extension to ...
118
click to vote
ESWS
2005
Springer
15 years 7 months ago
2005
Springer
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason ...
136
click to vote
ASP
2005
Springer
15 years 7 months ago
2005
Springer
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason ...