2364 search results - page 1 / 473 » An Engine for Computing Well-Founded Models |
ICLP
2009
Springer
13 years 11 months ago
2009
Springer
The seemingly simple choice of whether to use call variance or call subsumption in a tabled evaluation deeply affects an evaluation’s properties. Most tabling implementations hav...
CORR
2000
Springer
13 years 4 months ago
2000
Springer
DOOD
1997
Springer
13 years 8 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 ...
DLT
2006
13 years 5 months ago
2006
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
PDSE
1998
13 years 5 months ago
1998
As a means of modeling typical system behavior, we present a description technique for business processes derived from data flow nets and provide it with a formal semantics based ...