Sciweavers

977 search results - page 67 / 196
» Logic programming with infinite sets
Sort
View
PLPV
2011
ACM
14 years 3 months ago
Local actions for a curry-style operational semantics
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
Gordon Stewart, Andrew W. Appel
96
Voted
AGP
1998
IEEE
15 years 4 months ago
Dynamic Logic Programming
In this paper we investigate updates of knowledge bases represented by logic programs. In order to represent negative information, we use generalized logic programs which allow de...
José Júlio Alferes, João Alex...
124
Voted
CIE
2009
Springer
15 years 4 months ago
Functions Definable by Arithmetic Circuits
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
Ian Pratt-Hartmann, Ivo Düntsch
100
Voted
BIRTHDAY
2010
Springer
15 years 1 months ago
Thirteen Definitions of a Stable Model
Stable models of logic programs have been studied by many researchers, mainly because of their role in the foundations of answer set programming. This is a review of some of the de...
Vladimir Lifschitz
96
Voted
SGAI
2007
Springer
15 years 6 months ago
Learning Sets of Sub-Models for Spatio-Temporal Prediction
In this paper we describe a novel technique which implements a spatiotemporal model as a set of sub-models based on first order logic. These sub-models model different, typicall...
Andrew Bennett, Derek R. Magee