Name
Abstract | ||
|---|---|---|
. Transaction Logic was designed as a general logic of statechange for deductive databases and logic programs. It has a model theory,a proof theory, and its Horn subset can be given a procedural interpretation.Previous work has demonstrated that the combination ofdeclarative semantics and procedural interpretation turns the Horn subsetof Transaction Logic into a powerful language for logic programmingwith updates [BK98,BK94,BK93,BK95]. In this paper, we focus not onthe Horn subset, but... |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1007/BFb0055499 | Dagstuhl Seminars |
Keywords | Field | DocType |
model theory,proof theory | Transaction logic,Computational logic,Programming language,Horn clause,Computer science,Multimodal logic,Description logic,Theoretical computer science,Logic programming,Higher-order logic,Dynamic logic (modal logic) | Conference |
ISBN | Citations | PageRank |
3-540-65305-8 | 12 | 1.77 |
References | Authors | |
10 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anthony J. Bonner | 1 | 733 | 422.63 |
| Michael Kifer | 2 | 3980 | 950.22 |