Sciweavers

1950 search results - page 311 / 390
» Lambda-Free Logical Frameworks
Sort
View
NMELP
1994
15 years 10 months ago
Static Semantics as Program Transformation and Well-founded Computation
In this paper, we propose a new constructive characterization of those semantics for disjunctive logic programs which are extensions of the well-founded semantics for normal progra...
Stefania Costantini, Gaetano Aurelio Lanzarone
KR
2000
Springer
15 years 10 months ago
Finding Admissible and Preferred Arguments Can be Very Hard
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
WSPI
2008
15 years 7 months ago
Semantics of Information as Interactive Computation
Computers today are not only the calculation tools - they are directly (inter)acting in the physical world which itself may be conceived of as the universal computer (Zuse, Fredkin...
Gordana Dodig-Crnkovic
ASC
2006
15 years 7 months ago
A WAM implementation for flexible query answering
In [7] Maria I. Sessa extended the SLD resolution principle with the ability of performing approximate reasoning and flexible query answering. The operational mechanism of similar...
Pascual Julián Iranzo, Clemente Rubio-Manza...
AI
2008
Springer
15 years 6 months ago
Analysing inconsistent first-order knowledgebases
It is well-known that knowledgebases may contain inconsistencies. We provide a framework of measures, based on a first-order four-valued logic, to quantify the inconsistency of a ...
John Grant, Anthony Hunter