639 search results - page 54 / 128 » Dominance Constraints with Set Operators |
221
click to vote
FROCOS
2011
Springer
14 years 5 months ago
2011
Springer
A dominant approach to Satisfiability Modulo Theories (SMT) relies on the integration of a Conflict-Driven-Clause-Learning (CDCL) SAT solver and of a decision procedure able to h...
130
click to vote
JELIA
2004
Springer
15 years 11 months ago
2004
Springer
We present a framework for expressing different merging operators for belief sets. This framework is a generalisation of our earlier work concerning consistency-based belief revisi...
162
click to vote
NMR
2004
Springer
15 years 11 months ago
2004
Springer
We present a framework for investigating merging operators for belief sets. This framework is a generalisation of our earlier work concerning consistency-based belief revision and...
174
click to vote
WLP
1997
Springer
15 years 10 months ago
1997
Springer
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
147
click to vote
KBSE
1998
IEEE
15 years 9 months ago
1998
IEEE
Starting from a graphical data model (a subset of the OMT object model), a skeleton of formal specification can be generated and completed to express several constraints and provi...