#### Filter Results:

- Full text PDF available (14)

#### Publication Year

1998

2010

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

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Nikolay Pelov, Marc Denecker, Maurice Bruynooghe
- TPLP
- 2007

In this paper, we present a framework for the semantics and the computation of aggregates in the context of logic programming. In our study, an aggregate can be an arbitrary interpreted second orderâ€¦ (More)

- Nikolay Pelov, Marc Denecker, Maurice Bruynooghe
- Answer Set Programming
- 2003

We define a translation of aggregate programs to normal logic programs which preserves the set of partial stable models. We then define the classes of definite and stratified aggregate programs andâ€¦ (More)

- Nikolay Pelov, Marc Denecker, Maurice Bruynooghe
- LPNMR
- 2004

We introduce a family of partial stable model semantics for logic programs with arbitrary aggregate relations. The semantics are parametrized by the interpretation of aggregate relations inâ€¦ (More)

- Marc Denecker, Nikolay Pelov, Maurice Bruynooghe
- ICLP
- 2001

In [3] we investigate the problem of defining a well-founded and stable semantics for programs with aggregates. Our work is based on Approximation Theory [1] which is a general algebraic frameworkâ€¦ (More)

- Nikolay Pelov, Miroslaw Truszczynski
- NMR
- 2004

All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can be derived from it.â€¦ (More)

In this paper we introduce ODASE (Ontology Driven Architecture for Software Engineering). We present how we used ODASE to build a 250 person month e-insurance project for a multi-national insuranceâ€¦ (More)

- Nikolay Pelov, Eugenia Ternovska
- ICLP
- 2005

The FO(ID) logic is an extension of classical first-order logic with a uniform representation of various forms of inductive definitions. The definitions are represented as sets of rules and they areâ€¦ (More)

- Zdravko Markov, Nikolay Pelov
- AIMSA
- 1998

- Nikolay Pelov, Emmanuel De Mot, Maurice Bruynooghe
- ArXiv
- 2000

Many logic programming based approaches can be used to describe and solve combinatorial search problems. On the one hand there are definite programs and constraint logic programs that compute aâ€¦ (More)

- Nikolay Pelov, Maurice Bruynooghe
- PPDP
- 2000

The natural representation of solutions of nite constraint satisfaction problems is as a (set of) function(s) or relation(s). In (constraint) logic programming, answers are in the form ofâ€¦ (More)