6 search results - page 1 / 2 » Lemma and cut strategies for propositional model elimination |
AMAI
1999
Springer
13 years 4 months ago
1999
Springer
CORR
2008
Springer
13 years 4 months ago
2008
Springer
As an attempt to uncover the topological nature of composition of strategies in game semantics, we present a "topological" game for Multiplicative Additive Linear Logic ...
NGC
1998
Springer
13 years 4 months ago
1998
Springer
Reducing redundancy in search has been a major concern for automated deduction. Subgoal-reduction strategies, such as those based on model elimination and implemented in Prolog te...
AAAI
2006
13 years 6 months ago
2006
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
CADE
2002
Springer
14 years 5 months ago
2002
Springer
Abstract. Finite model search for first-order logic theories is complementary to theorem proving. Systems like Falcon, SEM and FMSET use the known LNH (Least Number Heuristic) heur...