41 search results - page 4 / 9 » The Extended Stable Models of Contradiction Removal Semantic... |
EPIA
2005
Springer
14 years 3 months ago
2005
Springer
Theoretical research has spent some years facing the problem of how to represent and provide semantics to updates of logic programs. This problem is relevant for addressing highly ...
KI
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Markov logic, as a highly expressive representation formalism that essentially combines the semantics of probabilistic graphical models with the full power of first-orde...
ICDE
1994
IEEE
14 years 1 months ago
1994
IEEE
The relational data model is based on sets of tuples, i.e. it does not allow duplicate tuples in a relation. Many database languages and systems do require multi-set place, the hi...
LPNMR
1993
Springer
14 years 1 months ago
1993
Springer
The notion of assumption-based framework generalises and re nes the use of abduction to give a formalisation of non-monotonic reasoning. In this framework, a sentence is a non-mon...
ICLP
1991
Springer
14 years 1 months ago
1991
Springer
Well Founded Semantics is adequate to capture nonmonotonic reasoning if we interpret the Well Founded model of a program P as a (possibly incomplete) view of the world. Thus the W...