4513 search results - page 21 / 903 » Logic programming with satisfiability |
ICTAI
1996
IEEE
15 years 2 months ago
1996
IEEE
In many applications, such as decision support, negotiation, planning, scheduling, etc., one needs to express requirements that can only be partially satisfied. In order to expres...
BIRTHDAY
2000
Springer
15 years 2 months ago
2000
Springer
A number of prioritized variants of Reiter’s default logic have been described in the literature. In this paper, we introduce two natural principles for preference handling and s...
FPL
2003
Springer
15 years 3 months ago
2003
Springer
By adapting to computations that are not so well supported by general-purpose processors, reconfigurable systems achieve significant increases in performance. Such computational sy...
AIML
2008
14 years 11 months ago
2008
We provide proof-theoretic results about deliberative STIT logic. First we present STIT logic for individual agents without time, where the problem of satisfiability has recently b...
115
click to vote
CADE
2007
Springer
15 years 10 months ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...