#### Filter Results:

- Full text PDF available (65)

#### Publication Year

1990

2009

- This year (0)
- Last 5 years (0)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Marco Schaerf, Marco Cadoli
- Artif. Intell.
- 1995

<lb>Problems in logic are well-known to be hard to solve in the worst case. Two<lb>di erent strategies for dealing with this aspect are known from the literature:<lb>language restriction and theory approximation.<lb>In this paper we are concerned with the second strategy. Our main goal<lb>is to de ne a semantically well-founded logic for approximate… (More)

- Marco Cadoli, Andrea Giovanardi, Marco Schaerf
- AAAI/IAAI
- 1998

The high computational complexity of advanced reasoning tasks such as belief revision and planning calls for efficient and reliable algorithms for reasoning problems harder than NP. In this paper 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… (More)

- Marco Cadoli, Marco Schaerf, Andrea Giovanardi, Massimo Giovanardi
- Journal of Automated Reasoning
- 2002

The high computational complexity of advanced reasoning tasks such as reasoning about knowledge and planning calls for efficient and reliable algorithms for reasoning problems harder than NP. In this paper we propose Evaluate, an algorithm for evaluating quantified Boolean formulae (QBFs). Algorithms for evaluation of QBFs are suitable for experimental… (More)

- Marco Cadoli, Francesco M. Donini
- AI Commun.
- 1997

Knowledge compilation is an AI technique for addressing computationally demanding reasoning problems. In this paper we survey recent results in knowledge compilation of propositional knowledge bases. We first define and limit the scope of such a technique, then we survey exact and approximate knowledge compilation methods. We include a discussion of… (More)

- Marco Cadoli, Giovambattista Ianni, Luigi Palopoli, Andrea Schaerf, Domenico Vasile
- Comput. Lang.
- 1999

- Marco Cadoli, Andrea Schaerf
- ESOP
- 2001

We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, which allows the definition of complex problems in a highly declarative way, and whose expressive power is such as to capture all problems which belong to the complexity class NP. The… (More)

- Marco Cadoli, Maurizio Lenzerini
- J. Comput. Syst. Sci.
- 1994

- Marco Cadoli, Thomas Eiter, Georg Gottlob
- IEEE Trans. Knowl. Data Eng.
- 1994

- Marco Cadoli, Maurizio Lenzerini
- AAAI
- 1990

Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. We present a detailed analysis of the computational complexity of the different forms of closed world reasoning for various fragments of propositional logic. The analysis allows us to draw a complete picture of the… (More)

- Marco Cadoli, Andrea Giovanardi, Marco Schaerf
- AI*IA
- 1997