1191 search results - page 160 / 239 » A Defeasible Ontology Language |
139
Voted
RULEML
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We extend Answer Set Programming with, possibly infinite, open domains. Since this leads, in general, to undecidable reasoning, we restrict the syntax of programs, while...
ISCIS
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. The focus of this paper is approaches to measuring similarity for application in content-based query evaluation. Rather than only comparing at the level of words, the iss...
105
click to vote
ISMIS
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. The focus of this paper is approaches to measuring similarity for application in content-based query evaluation. Rather than only comparing at the level of words, the iss...
122
click to vote
AUSAI
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. A novel declarative approach of forgetting in answer set programming (ASP) has been proposed recently. In this paper we report a system prototype of forgetting in ASP, ca...
103
click to vote
ECAI
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. With the advent of the Semantic Web, the question becomes important how to best combine open-world based ontology languages, like OWL, with closed-world rules paradigms. ...