A Framework for Inductive Learning Based on Subsumption Lattices. - Zdravko Markov; Nikolay Pelov (AIMSA, 1998)

Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog. - Nikolay Pelov; Maurice Bruynooghe (LPAR, 1999)

Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison. - Nikolay Pelov; Emmanuel De Mot; Marc Denecker (LPAR, 2000)

Extending constraint logic programming with open functions. - Nikolay Pelov; Maurice Bruynooghe (PPDP, 2000)

A Comparison of Logic Programming Approaches for Representation and Solving of Constraint Satisfaction Problems - Nikolay Pelov; Emmanuel De Mot; Maurice Bruynooghe (CoRR, 2000)

Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates. - Marc Denecker; Nikolay Pelov; Maurice Bruynooghe (ICLP, 2001)

Translation of Aggregate Programs to Normal Logic Programs. - Nikolay Pelov; Marc Denecker; Maurice Bruynooghe (Answer Set Programming, 2003)

Partial Stable Models for Logic Programs with Aggregates. - Nikolay Pelov; Marc Denecker; Maurice Bruynooghe (LPNMR, 2004)

Semantics of disjunctive programs with monotone aggregates - an operator-based approach. - Nikolay Pelov; Miroslaw Truszczynski (NMR, 2004)

Reducing Inductive Definitions to Propositional Satisfiability. - Nikolay Pelov; Eugenia Ternovska (ICLP, 2005)

Well-founded and stable semantics of logic programs with aggregates. - Nikolay Pelov; Marc Denecker; Maurice Bruynooghe (Theory Pract. Log. Program., 2007)