• Publications
  • Influence
Tractable Reasoning via Approximation
TLDR
We define a method for the approximation of decision reasoning problems based on multivalued logics. Expand
  • 207
  • 31
An Algorithm to Evaluate Quantified Boolean Formulae
TLDR
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
  • 173
  • 22
  • PDF
Arbitration (or How to Merge Knowledge Bases)
TLDR
We investigate the properties that any arbitration operator should satisfy. Expand
  • 192
  • 18
  • PDF
An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation
TLDR
We propose Evaluate, an algorithm for evaluating quantified Boolean formulae (QBFs). Expand
  • 139
  • 13
Describing and reasoning on Web services using process algebra
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
  • 285
  • 11
  • PDF
Preprocessing of Intractable Problems
TLDR
We propose new models of computation, complexity classes, and reductions that can be used to prove or disprove that a problem is compilable. Expand
  • 69
  • 6
  • PDF
Describing and reasoning on Web services using process algebra
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
  • 108
  • 4
Experimental Analysis of the Computational Cost of Evaluating Quantified Boolean Formulae
TLDR
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
  • 33
  • 4
On the complexity of entailment in propositional multivalued logics
  • Marco Cadoli, M. Schaerf
  • Mathematics, Computer Science
  • Annals of Mathematics and Artificial Intelligence
  • 1 March 1996
TLDR
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
  • 35
  • 3
Belief Revision and Update: Complexity of Model Checking
TLDR
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
  • 25
  • 3
  • PDF