507 search results - page 81 / 102 » Automating first-order relational logic |
99
Voted
ICLP
2004
Springer
15 years 6 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
110
Voted
LPAR
2004
Springer
15 years 6 months ago
2004
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
113
click to vote
LICS
2002
IEEE
15 years 5 months ago
2002
IEEE
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
109
click to vote
KR
1992
Springer
15 years 4 months ago
1992
Springer
Abstract, We consider the problem of integrating Reiter's default logic into terminological representation systems. It turns out that such an integration is less straightforwa...
132
Voted
AI
2010
Springer
15 years 22 days ago
2010
Springer
We develop a formal framework for comparing different versions of ontologies, and apply it to ontologies formulated in terms of DL-Lite, a family of `lightweight' description...