Sciweavers

1020 search results - page 70 / 204
» Tight Semantics for Logic Programs
Sort
View
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 6 months ago
XSB: Extending Prolog with Tabled Logic Programming
The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this ar...
Terrance Swift, David Scott Warren
KI
2009
Springer
14 years 1 months ago
Beyond Public Announcement Logic: An Alternative Approach to Some AI Puzzles
In the paper we present a dynamic model of knowledge. The model is inspired by public announcement logic and an approach to a puzzle concerning knowledge and communication using th...
Pawel Garbacz, Piotr Kulicki, Marek Lechniak, Robe...
TPHOL
1998
IEEE
14 years 1 months ago
Program Abstraction in a Higher-Order Logic Framework
Abstraction in a Higher-Order Logic Framework Marco Benini Sara Kalvala Dirk Nowotka Department of Computer Science University of Warwick, Coventry, CV4 7AL, United Kingdom We pres...
Marco Benini, Sara Kalvala, Dirk Nowotka
PODS
1990
ACM
148views Database» more  PODS 1990»
14 years 28 days ago
Stable Models and Non-Determinism in Logic Programs with Negation
Previous researchers have proposed generalizations of Horn clause logic to support negation and nondeterminism as two separate extensions. In this paper, we show that the stable m...
Domenico Saccà, Carlo Zaniolo
RR
2010
Springer
13 years 7 months ago
Defeasibility in Answer Set Programs via Argumentation Theories
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
Hui Wan, Michael Kifer, Benjamin N. Grosof