Sciweavers

1313 search results - page 50 / 263
» Prioritized Reasoning in Logic Programming
Sort
View
AI
2002
Springer
14 years 9 months ago
On the computational complexity of assumption-based argumentation for default reasoning
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
PERCOM
2007
ACM
15 years 4 months ago
A Performance Evaluation of Ontology-Based Context Reasoning
The CARE middleware aims at supporting contextaware adaptation of Internet services in a mobile computing environment. The CARE hybrid reasoning mechanism is based on a loose inte...
Alessandra Agostini, Claudio Bettini, Daniele Ribo...
IGPL
2010
91views more  IGPL 2010»
14 years 4 months ago
A reason maintenance perspective on relevant Ramsey conditionals
This paper presents a Ramsey account of conditionals within the framework of an implemented reason maintenance system. The reason maintenance system is built on top of a deductive...
Haythem O. Ismail
ICALP
1998
Springer
15 years 1 months ago
Difficult Configurations - On the Complexity of LTrL
The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also ca...
Igor Walukiewicz
ASP
2003
Springer
15 years 2 months ago
Using Nested Logic Programs for Answer Set Programming
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
Thomas Linke