We propose Evaluate, an algorithm for evaluating Quantified Boolean Formulae, a language that extends propositional logic in a way such that many advanced forms of propositional reasoning, e.g., reasoning about knowledge, can be easily formulated as evaluation of a QBF.Expand

Proceedings. IEEE International Conference on Web…

9 June 2006

TLDR

We argue that essential facets of Web services, and especially those useful to understand their interaction, can be described using process-algebraic notations.Expand

We argue that essential facets of Web services, and especially those useful to understand their interaction, can be described using process-algebraic notations.Expand

We analyze the problem of evaluating Quantified Boolean Formulae, which is the prototypical complete problem for all levels of the Polynomial Hierarchy, the computationally simplest hierarchy of complexity classes above NP of great interest to KR.Expand

This paper presents a detailed picture of the impact that the semantic definition, the synthactic form and the assumptions on the relative sizes of the inputs have on the complexity of entailment checking of multivalued logics.Expand

We study the computational complexity, in the propositional case, of one of the main reasoning problems of belief revision and update: deciding if an interpretation M is a model of the revised knowledge base.Expand