LPNMR
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. This paper studies computational issues related to the problem of reasoning about actions and change (RAC) by exploiting its link with the Answer Set Programming paradigm...
LPAR
2004
Springer
13 years 10 months ago
2004
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
RULEML
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The language of dl-programs is a latest effort in developing an expressive representation for Web-based ontologies. It allows to build answer set programming (ASP) on top...
LPNMR
2005
Springer
13 years 10 months ago
2005
Springer
Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound wth respect to the answer set semantics. The main the...
ASP
2005
Springer
13 years 10 months ago
2005
Springer
This paper studies compositional semantics of nonmonotonic logic programs. We suppose the answer set semantics of extended disjunctive programs and consider the following problem. ...
ASP
2005
Springer
13 years 10 months ago
2005
Springer
In this paper we consider an extension of the answer set semantics allowing arbitrary use of strong negation. We prove that the strong negation extension of any intermediate logic ...
ASP
2005
Springer
13 years 10 months ago
2005
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
ASP
2005
Springer
13 years 10 months ago
2005
Springer
This paper discusses the background, algorithms and implementation techniques to support programmers in ‘debugging’ logic programs under the answer set semantics. We first inv...
IAT
2008
IEEE
13 years 11 months ago
2008
IEEE
In this work we introduce the first steps towards the definition of an answer set semantics for residuated logic programs with negation.
LPNMR
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...