352 search results - page 53 / 71 » Paraconsistent Declarative Semantics for Extended Logic Prog... |
116
Voted
ICLP
1991
Springer
15 years 6 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...
113
Voted
ICFP
2010
ACM
15 years 3 months ago
2010
ACM
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
100
Voted
KI
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Rule-based programming paradigm is omnipresent in number of engineering domains. However, there are some fundamental semantical differences between it, and classic progr...
138
Voted
APAL
2008
15 years 2 months ago
2008
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
123
Voted
EACL
1993
ACL Anthology
15 years 4 months ago
1993
ACL Anthology
The strategy for natural language interpretation presented in this paper implements the dynamics of context change by translating natural language texts into a meaning representat...