Sciweavers

140 search results - page 25 / 28
» Stable Models and Non-Determinism in Logic Programs with Neg...
Sort
View
ICLP
2010
Springer
15 years 3 months ago
HEX Programs with Action Atoms
hex programs were originally introduced as a general framework for extending declarative logic programming, under the stable model semantics, with the possibility of bidirectional...
Selen Basol, Ozan Erdem, Michael Fink, Giovambatti...
KR
1998
Springer
15 years 3 months ago
Specifying Transactions for Extended Abduction
Extended abduction introduced by Inoue and Sakama (1995) generalizes traditional abduction in the sense that it can compute negative explanations by removing hypotheses from a non...
Katsumi Inoue, Chiaki Sakama
PPDP
2007
Springer
15 years 5 months ago
Mechanized metatheory model-checking
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...
James Cheney, Alberto Momigliano
95
Voted
ICLP
1991
Springer
15 years 3 months ago
Nonmonotonic Reasoning with Well Founded Semantics
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...
Luís Moniz Pereira, Joaquim Nunes Apar&iacu...
84
Voted
ECAI
2008
Springer
15 years 1 months ago
A Coherent Well-founded Model for Hybrid MKNF Knowledge Bases
Abstract. With the advent of the Semantic Web, the question becomes important how to best combine open-world based ontology languages, like OWL, with closed-world rules paradigms. ...
Matthias Knorr, José Júlio Alferes, ...