16 search results - page 2 / 4 » Defeasibility in Answer Set Programs via Argumentation Theor... |
ENC
2008
IEEE
13 years 11 months ago
2008
IEEE
In many fields of automated information processing it becomes crucial to consider together imprecise, uncertain or inconsistent information. Argumentation theory is a suitable fr...
ESWS
2005
Springer
13 years 10 months ago
2005
Springer
There is an ongoing discussion whether reasoning in the Semantic Web should be monotonic or not. It seems however that the problem concerns not only the reasoning over knowledge bu...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
The field of machine learning (ML) is concerned with the question of how to construct algorithms that automatically improve with experience. In recent years many successful ML app...
JELIA
2010
Springer
13 years 3 months ago
2010
Springer
In this paper, we show that Reiter’s default logic in the propositional case can be translated into answer set programming by identifying the internal relationships among formula...
NDJFL
2010
12 years 11 months ago
2010
The question of the origin of polyadic expressivity is explored and the results are brought to bear on Bertrand Russell's 1903 theory of denoting concepts, which is the main o...