1795 search results - page 116 / 359 » On the Complexity of Circuit Satisfiability |
BIRTHDAY
2004
Springer
14 years 19 days ago
2004
Springer
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...
IAT
2007
IEEE
14 years 23 days ago
2007
IEEE
Multiagent systems (MAS) satisfy to design requirements for open physical complex systems. However, up to now, no method allows to build software/hardware hybrid multiagent system...
AIML
2008
13 years 10 months ago
2008
In this paper we prove that Japaridze's Polymodal Logic is PSPACE-decidable. To show this, we describe a decision procedure for satisfiability on hereditarily ordered frames t...
JAPLL
2006
13 years 8 months ago
2006
This paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with looping, repeat, test, intersection, converse, program complementation as well as context...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...