Name
Abstract | ||
|---|---|---|
An extension of predicate logic, called Transaction Logic, is proposed, which accounts in a clean and declarative fashion for the phenomenon of state changes in logic programs and databases. Transaction Logic has a natural model theory and a sound and complete proof theory, but unlike many other logics, it allows users to program transactions. The semantics leads naturally to features whose amalgamation in a single logic has proved elusive in the past. These features include both hypothetical... |
Year | Venue | Keywords |
|---|---|---|
1993 | ICLP | transaction logic programming,model theory,proof theory |
Field | DocType | ISSN |
Transaction logic,Functional logic programming,Computational logic,Horn clause,Computer science,Algorithm,Theoretical computer science,Prolog,Logic programming,Higher-order logic,Dynamic logic (modal logic) | Conference | 1061-0464 |
ISBN | Citations | PageRank |
0-262-73105-3 | 88 | 16.13 |
References | Authors | |
18 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anthony J. Bonner | 1 | 733 | 422.63 |
| Michael Kifer | 2 | 3980 | 950.22 |