In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate that inherentâ€¦ (More)

Autoepistemic logic is one of the principal modes of nonmonotonicreasoning. It unifies several other modes of nonmonotonic reasoning andhas important application in logic programming. In the paper, aâ€¦ (More)

Nonmonotonic reasoning forms one of the main components of the logical approach to Artificial Intelligence and Knowledge Representation. Relatively large portions of the leading AI journals andâ€¦ (More)

We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is an abstract constraint (formally, aâ€¦ (More)

1 I n t r o d u c t i o n In th is p a p e r we propose and s t u d y a new fo rma l i sm for speci fy ing necessa ry revis ions in sys tems such as da t abases , knowledge bases and bel ief sets. Tâ€¦ (More)

We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form ã€ˆX,Fã€‰ where X is a finite set ofâ€¦ (More)

In this paper, we describe an automated reasoning system, called DeReS. DeReS implements default logic of Reiter by supporting several basic reasoning tasks such as testing whether extensions exist,â€¦ (More)

In this paper we introduce revision programming â€” a logic-based framework for describing constraints on databases and providing a computational mechanism to enforce them. Revision programmingâ€¦ (More)