Sciweavers

193 search results - page 15 / 39
» On the Progression Semantics and Boundedness of Answer Set P...
Sort
View
LPNMR
2007
Springer
15 years 3 months ago
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
Michael Fink, Reinhard Pichler, Hans Tompits, Stef...
AAAI
2008
14 years 11 months ago
Using Answer Set Programming and Lambda Calculus to Characterize Natural Language Sentences with Normatives and Exceptions
One way to solve the knowledge acquisition bottleneck is to have ways to translate natural language sentences and discourses to a formal knowledge representation language, especia...
Chitta Baral, Juraj Dzifcak, Tran Cao Son
CORR
2010
Springer
123views Education» more  CORR 2010»
14 years 9 months ago
Loop Formulas for Description Logic Programs
Description Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logic...
Yisong Wang, Jia-Huai You, Li-Yan Yuan, Yi-Dong Sh...
BIRTHDAY
2005
Springer
15 years 3 months ago
Planning in Answer Set Programming using Ordered Task Decomposition
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
Jürgen Dix, Ugur Kuter, Dana S. Nau
76
Voted
LPNMR
2007
Springer
15 years 3 months ago
GrinGo : A New Grounder for Answer Set Programming
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approach...
Martin Gebser, Torsten Schaub, Sven Thiele