Sciweavers

27 search results - page 3 / 6
» Generalized, efficient array decision procedures
Sort
View
96
Voted
IJCAI
2003
15 years 4 months ago
Qualitative Decision under Uncertainty: Back to Expected Utility
Different qualitative models have been proposed for decision under uncertainty in Artificial Intelli­ gence, but they generally fail to satisfy the princi­ ple of strict Pareto ...
Hélène Fargier, Régis Sabbadi...
139
Voted
CADE
2009
Springer
16 years 3 months ago
A Generalization of Semenov's Theorem to Automata over Real Numbers
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
Bernard Boigelot, Jérôme Leroux, Juli...
114
Voted
CADE
2006
Springer
16 years 3 months ago
Solving Sparse Linear Constraints
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
Shuvendu K. Lahiri, Madanlal Musuvathi
127
Voted
AIPS
2008
15 years 5 months ago
A Compact and Efficient SAT Encoding for Planning
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...
131
Voted
LATA
2010
Springer
16 years 3 days ago
Complexity of the Satisfiability Problem for a Class of Propositional Schemata
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...