#### Filter Results:

- Full text PDF available (196)

#### Publication Year

1991

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

- Tran Cao Son, Enrico Pontelli
- LPNMR
- 2004

We present a declarative language, È È , for the specification of preferences between possible solutions (or trajectories) of a planning problem. This novel language allows users to elegantly express non-trivial, multi-dimensional preferences and priorities over them. The semantics of È Èallows the identification of most preferred trajectories of a given… (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)

- Lengning Liu, Enrico Pontelli, Tran Cao Son, Miroslaw Truszczynski
- Artif. Intell.
- 2007

We provide a new perspective on the semantics of logic programs with arbitrary abstract constraints. To this end, we introduce several notions of computation. We use the results of computations to specify answer sets of programs with constraints. We present the rationale behind the classes of computations we consider, and discuss the relationships among… (More)

- Enrico Pontelli, Tran Cao Son
- ICLP
- 2006

The paper introduces the notion of off-line justification for Answer Set Programming (ASP). Justifications provide a graph-based explanation of the truth value of an atom w.r.t. a given answer set. The paper extends also this notion to provide justification of atoms during the computation of an answer set (on-line justification), and presents an integration… (More)

- Enrico Pontelli, Tran Cao Son, Phan Huy Tu
- J. Artif. Intell. Res.
- 2006

In this paper, we present two alternative approaches to defining answer sets for logic programs with arbitrary types of abstract constraint atoms (c-atoms). These approaches generalize the fixpoint-based and the level mapping based answer set semantics of normal logic programs to the case of logic programs with arbitrary types of c-atoms. The results are… (More)

- Tran Cao Son, Enrico Pontelli
- ArXiv
- 2005

This technical note describes a monotone and continuous fixpoint operator to compute the answer sets of programs with aggregates. The fixpoint operator relies on the notion of aggregate solution. Under certain conditions, this operator behaves identically to the three-valued immediate consequence operator Φ aggr P for aggregate programs, independently… (More)

- Enrico Pontelli, Gopal Gupta, Manuel V. Hermenegildo
- IPPS
- 1995

Logic programming is a paradigm of programming based on a subset of rst order logic. An important property of logic programming languages, such as Prolog, is that their declarative semantics is largely independent of the order in which diierent operations are performed during execution of the program. The diierent operations can also be performed in… (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)

- Alessandro Dal Palù, Agostino Dovier, Enrico Pontelli
- Softw., Pract. Exper.
- 2007

This paper presents the design, implementation and application of a Constraint Programming framework on 3D crystal lattices. The framework provides the flexibility to express and resolve constraints dealing with structural relationships of entities placed in a 3D lattice structure in space. The paper describes both sequential and parallel implementations of… (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.