168 search results - page 15 / 34 » On Models for Quantified Boolean Formulas |
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Some natural epistemic properties which may arise in applications can only be expressed in standard epistemic logic by formulae which are exponentially long in the number of agent...
ICAI
2003
13 years 9 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
ENTCS
2007
13 years 7 months ago
2007
We introduce a class of coalgebraic models and a family of modal logics that support the speci cation of spatial properties of distributed applications. The evaluation of a formul...
TPHOL
2007
IEEE
14 years 1 months ago
2007
IEEE
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...
JANCL
2007
13 years 7 months ago
2007
The aim of this paper is to give new kinds of modal logics suitable for reasoning about regions in discrete spaces. We call them dynamic logics of the region-based theory of discr...