Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

ECAI
2006
Springer

favoriteEmaildiscussreport

147views Artificial Intelligence» more ECAI 2006»

Approximating Extended Answer Sets

13 years 8 months ago

Approximating Extended Answer Sets

Download www.kr.tuwien.ac.at

Abstract. We present an approximation theory for the extended answer set semantics, using the concept of an approximation constraint. Intuitively, an approximation constraint, while satisfied by a "perfect" solution, may be left unsatisfied in an approximate extended answer set. Approximations improve as the number of unsatisfied constraints decreases. We show how the framework can also capture the classical answer set semantics, thus providing an approximative version of the latter.

Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir

Real-time Traffic

Answer Set | Answer Set Semantics | Approximation Constraint | Artificial Intelligence | ECAI 2006 |

claim paper

Related Content

» Weighted Answer Sets and Applications in Intelligence Analysis

» Approximate Query Answering by Model Averaging

» On the Existence of Answer Sets in Normal Extended Logic Programs

» Extending Answer Sets for Logic Programming Agents

» Answer Set Programming on Expert Feedback to Populate and Extend Dynamic Ontologies

» Intelligence Analysis Using Quantitative Preferences

» Answering approximate string queries on large data sets using external memory

» Approximating Answer Sets of Unitary LifschitzWoo Programs

» HistogramBased Approximation of SetValued QueryAnswers

Post Info
More Details (n/a)

Added	22 Aug 2010
Updated	22 Aug 2010
Type	Conference
Year	2006
Where	ECAI
Authors	Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir

Comments (0)