#### Filter Results:

- Full text PDF available (58)

#### Publication Year

1987

2016

- This year (0)
- Last 5 years (15)
- Last 10 years (25)

#### 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)

- Paolo Liberatore, Marco Schaerf
- IEEE Trans. Knowl. Data Eng.
- 1998

Knowledge-based systems must be able to “intelligently” manage a large amount of information coming from different sources and at different moments in time. Intelligent systems must be able to cope with a changing world by adopting a “principled” strategy. Many formalisms have been put forward in the AI and DB literature to address this problem. Among them,… (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)

- Gwen Salaün, Lucas Bordeaux, Marco Schaerf
- Proceedings. IEEE International Conference on Web…
- 2004

We argue that essential facets of Web services, and especially those useful to understand their interaction, can be described using process-algebraic notations. Web service description and execution languages such as BPEL are essentially process description languages; they are based on primitives for behaviour description and message exchange which can also… (More)

- Paolo Liberatore, Marco Schaerf
- WOCFAI
- 1995

The ability of Database Systems to cope with changing situations and information coming from different sources is crucial for their applicability in real-world scenarios. Recent work in the field of belief revision and update has provided us techniques to handle change. In this paper we introduce a different form of revision aiming at capturing the process… (More)

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

- Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
- Artif. Intell.
- 1995

In this paper we address a specific computational aspect of belief revision: The size of the propositional formula obtained by means of the revision of a formula with a new one. In particular, we focus on the size of the smallest formula equivalent to the revised knowledge base. The main result of this paper is that not all formalizations of belief revision… (More)

- Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf
- Inf. Comput.
- 2002

Some computationally hard problems –e.g., deduction in logical knowledge bases– are such that part of an instance is known well before the rest of it, and remains the same for several subsequent instances of the problem. In these cases, it is useful to preprocess off-line this known part so as to simplify the remaining on-line problem. In this paper we… (More)

- Marco Cadoli, Marco Schaerf
- J. Log. Program.
- 1993