#### Filter Results:

- Full text PDF available (119)

#### Publication Year

1991

2017

- This year (2)
- Last 5 years (32)
- Last 10 years (73)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Agostino Dovier, Carla Piazza, Alberto Policriti
- CAV
- 2001

In this paper we propose an efficient algorithmic solution to the problem of determining a Bisimulation Relation on a finite structure. Starting from a set-theoretic point of view we propose an algorithm that optimizes the solution to the Relational coarsest Partition problem given by Paige and Tarjan in 1987 and its use in model-checking packages is… (More)

- Agostino Dovier, Eugenio G. Omodeo, Enrico Pontelli, Gianfranco Rossi
- J. Log. Program.
- 1996

An extended logic programming language is presented, that embodies the fundamental form of set designation based on the (nesting) element insertion operator. The kind of sets to be handled is characterized both by adaptation of a suitable Herbrand universe and via axioms. Predicates 2 and = designating set membership and equality are included in the base… (More)

- Agostino Dovier, Carla Piazza, Alberto Policriti
- Theor. Comput. Sci.
- 2004

We propose an efficient algorithmic solution to the problem of determining a Bisimulation Relation on a finite structure working both on the explicit and on the implicit (symbolic) representation. As far as the explicit case is concerned, starting from a set-theoretic point of view we propose an algorithm that optimizes the solution to the Relational… (More)

- Agostino Dovier, Carla Piazza
- IEEE Trans. Knowl. Data Eng.
- 2003

We study the complexity of the Subgraph Bisimulation Problem, which stands to Graph Bisimulation as Subgraph Isomorphism stands to Graph Isomorphism and we prove its NP-Completeness. Our analysis is motivated by its applications to Semistructured Databases.

- Agostino Dovier, Carla Piazza, Alberto Policriti
- FroCoS
- 1999

In this paper we consider the relative expressive power of two very common operators applicable to sets and multisets: the with and the union operators. For such operators we prove that they are not mutually expressible by means of existentially quantified formulae. In order to prove our results, canonical forms for set-theoretic and multiset-theoretic… (More)

- Alessandro Dal Palù, Agostino Dovier, Enrico Pontelli, Gianfranco Rossi
- Fundam. Inform.
- 2009

In this paper we present a novel methodology to compute stable models in Answer Set Programming. The process is performed with a bottom-up approach that does not require the preprocessing of the typical grounding phase. The implementation is completely in Prolog and Constraint Logic Programming over finite domains.

- Federico Fogolari, Lidia Pieri, +5 authors Paolo Viglino
- BMC Structural Biology
- 2006

Reduced representations of proteins have been playing a keyrole in the study of protein folding. Many such models are available, with different representation detail. Although the usefulness of many such models for structural bioinformatics applications has been demonstrated in recent years, there are few intermediate resolution models endowed with an… (More)

- Alessandro Dal Palù, Agostino Dovier, Federico Fogolari
- BMC Bioinformatics
- 2004

The protein structure prediction problem is one of the most challenging problems in biological sciences. Many approaches have been proposed using database information and/or simplified protein models. The protein structure prediction problem can be cast in the form of an optimization problem. Notwithstanding its importance, the problem has very seldom been… (More)

- Agostino Dovier, Carla Piazza, Enrico Pontelli, Gianfranco Rossi
- ACM Trans. Program. Lang. Syst.
- 2000

In this paper we present a study of the problem of handling constraints made by conjunctions of positive and negative literals based on the predicate symbols =, <inline-equation> <f> ∈,<hsp sp="0.265">∪</f> </inline-equation> and <inline-equation> <f> &dvbm0;</f> </inline-equation> (i.e., disjointness of two sets) in a (hybrid) universe of <?Pub… (More)

An extended logic programming language embodying sets is developed in successive stages, introducing at each stage simple set dictions and operations, and discussing their operational as well as declarative semantics. First, by means of special set terms added to definite Horn Clause logic, one is enabled to define enumerated sets. A new unification… (More)