Search Sciweavers | Sciweavers

30 search results - page 3 / 6

» SLT-Resolution for the Well-Founded Semantics

click to vote

DLT
2006

132views Theoretical Computer Science» more DLT 2006»

Well-Founded Semantics for Boolean Grammars

13 years 8 months ago

Download cgi.di.uoa.gr

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...

claim paper

Read More »

click to vote

AAAI
2012

206views Intelligent Agents» more AAAI 2012»

Equality-Friendly Well-Founded Semantics and Applications to Description Logics

11 years 9 months ago

Download ceur-ws.org

We tackle the problem of deﬁning a well-founded semantics (WFS) for Datalog rules with existentially quantiﬁed variables in their heads and negations in their bodies. In partic...

Georg Gottlob, André Hernich, Clemens Kupke...

claim paper

Read More »

click to vote

ASP
2001
Springer

106views Automated Reasoning» more ASP 2001»

Well Founded Semantics as Two dimensional Here and There

13 years 12 months ago

Download www.aaai.org

This workpresents a newlogical characterization of well foundedsemanticsthat provides, as interesting innovation, a fully semantic-oriented treatment of programconnectives without...

Pedro Cabalar

claim paper

Read More »

click to vote

JELIA
1992
Springer

102views Artificial Intelligence» more JELIA 1992»

Default Theory for Well Founded Semantics with Explicit Negation

13 years 11 months ago