Sciweavers

565 search results - page 27 / 113
» Extending Answer Sets for Logic Programming Agents
Sort
View
LPNMR
2011
Springer
13 years 1 hour ago
Communicating ASP and the Polynomial Hierarchy
Communicating answer set programming is a framework to represent and reason about the combined knowledge of multiple agents using the idea of stable models. The semantics and expre...
Kim Bauters, Steven Schockaert, Dirk Vermeir, Mart...
CORR
2010
Springer
123views Education» more  CORR 2010»
13 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...
JAIR
2008
104views more  JAIR 2008»
13 years 9 months ago
Sound and Complete Inference Rules for SE-Consequence
The notion of strong equivalence on logic programs with answer set semantics gives rise to a consequence relation on logic program rules, called SE-consequence. We present a sound...
Ka-Shu Wong
ECAI
2010
Springer
13 years 10 months ago
On Semantic Update Operators for Answer-Set Programs
Logic programs under the stable models semantics, or answer-set programs, provide an expressive rule based knowledge representation framework, featuring formal, declarative and wel...
Martin Slota, João Leite
LPNMR
2007
Springer
14 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...