140 search results - page 22 / 28 » Stable Models and Non-Determinism in Logic Programs with Neg... |
204
click to vote
AI
2011
Springer
14 years 6 months ago
2011
Springer
An important question for the upcoming Semantic Web is how to best combine open world ontology languages, such as the OWL-based ones, with closed world rule-based languages. One o...
BIBM
2009
IEEE
15 years 4 months ago
2009
IEEE
—In this paper we propose the use of answer set programming (ASP) to model protein interaction networks. We argue that this declarative formalism rivals the popular boolean netwo...
95
Voted
CORR
2002
Springer
14 years 11 months ago
2002
Springer
In the present paper, the existence and multiplicity problems of extensions are addressed. The focus is on extension of the stable type. The main result of the paper is an elegant...
98
Voted
BIRTHDAY
2005
Springer
15 years 5 months ago
2005
Springer
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...
107
click to vote
AUSAI
2004
Springer
15 years 5 months ago
2004
Springer
The PolicyUpdater1 system is a fully-implemented access control system that provides policy evaluations as well as dynamic policy updates. These functions are achieved by the use o...