3323 search results - page 136 / 665 » Computational Semantics with Functional Programming |
145
click to vote
AAAI
1994
15 years 6 months ago
1994
We present a method of representing some classes of default theories as normal logic programs. The main point is that the standard semantics (i.e. SLDNF-resolution) computes answe...
117
click to vote
LICS
2007
IEEE
15 years 11 months ago
2007
IEEE
According to Strachey, a polymorphic program is parametric if it applies a uniform algorithm independently of the type instantiations at which it is applied. The notion of relatio...
149
Voted
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
1 Learnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type o...
147
click to vote
AAAI
2008
15 years 7 months ago
2008
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...
165
click to vote
DOOD
1997
Springer
15 years 9 months ago
1997
Springer
Abstract. We present a well-founded semantics for deductive objectoriented database (dood) languages by applying the alternating- xpoint characterization of the well-founded model ...