Sciweavers

Share
281 search results - page 1 / 57
» Static Semantics as Program Transformation and Well-founded ...
Sort
View
DLT
2006
9 years 9 months ago
Well-Founded Semantics for Boolean Grammars
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 ...
Vassilis Kountouriotis, Christos Nomikos, Panos Ro...
LPNMR
2001
Springer
10 years 12 days ago
A Comparative Study of Well-Founded Semantics for Disjunctive Logic Programs
Much work has been done on extending the well-founded semantics to general disjunctive logic programs and various approaches have been proposed. However, no consensus has been reac...
Kewen Wang
ICLP
2009
Springer
10 years 2 months ago
An Engine for Computing Well-Founded Models
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...
Terrance Swift
CADE
2001
Springer
10 years 8 months ago
A Top-Down Procedure for Disjunctive Well-Founded Semantics
Abstract. Skepticism is one of the most important semantic intuitions in artificial intelligence. The semantics formalizing skeptical reasoning in (disjunctive) logic programming i...
Kewen Wang
DOOD
1997
Springer
134views Database» more  DOOD 1997»
10 years 4 days ago
Well-Founded Semantics for Deductive Object-Oriented Database Languages
Abstract. We present a well-founded semantics for deductive objectoriented database (dood) languages by applying the alternating- xpoint characterization of the well-founded model ...
Wolfgang May, Bertram Ludäscher, Georg Lausen
books