764 search results - page 64 / 153 » On the Expressibility of Stable Logic Programming |
164
Voted
SEBD
2001
15 years 5 months ago
2001
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear ...
131
Voted
LPKR
1997
Springer
15 years 7 months ago
1997
Springer
Abstract. Recently the field of theory update has seen some improvement, in what concerns model updating, by allowing updates to be specified by so-called revision programs. The ...
231
Voted
POPL
2004
ACM
16 years 4 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
132
Voted
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
158
Voted
DKE
2010
15 years 3 months ago
2010
We describe the Consistency Extractor System (ConsEx) that computes consistent answers to Datalog queries with negation posed to relational databases that may be inconsistent with...