504 search results - page 18 / 101 » The Complexity of Symmetry-Breaking Formulas |
ILP
2003
Springer
14 years 3 months ago
2003
Springer
We study several complexity parameters for first order formulas and their suitability for first order learning models. We show that the standard notion of size is not captured by...
LPAR
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic thanks to ...
ICANN
2003
Springer
14 years 3 months ago
2003
Springer
We discuss a Probably Approximate Correct (PAC) learning paradigm for Boolean formulas, which we call PAC meditation, where the class of formulas to be learnt is not known in advan...
ATAL
2006
Springer
14 years 1 months ago
2006
Springer
This paper presents complexity results for model checking concurrent programs against temporal-epistemic formulae. We apply these results to evaluate the complexity of verifying p...
ATAL
2006
Springer
14 years 1 months ago
2006
Springer
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...