Tabling for transaction logic

Authors:
Paul Fodor;Michael Kifer
Affiliations:
State University of New York at Stony Brook, Stony Brook, NY, USA;State University of New York at Stony Brook, Stony Brook, NY, USA
Venue:
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Year:
2010

Citing 20
Cited 0

The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Memoing for logic programs

Communications of the ACM
Transaction logic programming

ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
An overview of transaction logic

Theoretical Computer Science - Special issue on formal methods in databases and software engineering
An abstract machine for SLG resolution: definite programs

ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Tabled evaluation with delaying for general logic programs

Journal of the ACM (JACM)
Logic based modeling and analysis of workflows

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A logic for programming database transactions

Logics for databases and information systems
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
OLD Resolution with Tabulation

Proceedings of the Third International Conference on Logic Programming
Applications of Transaction Logic to Knowledge Representation

ICTL '94 Proceedings of the First International Conference on Temporal Logic
The State of Change: A Survey

ILPS '97 International Seminar on Logic Databases and the Meaning of Change, Transactions and Change in Logic Databases
Results on Reasoning about Updates in Transaction Logic

ILPS '97 International Seminar on Logic Databases and the Meaning of Change, Transactions and Change in Logic Databases
Modular Composition of Transaction Programs with Deductive Databases

DBLP-6 Proceedings of the 6th International Workshop on Database Programming Languages
Term indexing

Handbook of automated reasoning
CTR-S: a logic for specifying contracts in semantic web services

Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Reasoning about the behavior of Semantic Web services with concurrent transaction logic

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
A dichromatic framework for balanced trees

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
An approach for data-driven and logic-based complex Event Processing

Proceedings of the Third ACM International Conference on Distributed Event-Based Systems
A logic for state-modifying authorization policies

ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Transaction Logic is a logic for representing declarative and procedural knowledge in logic programming, databases, and AI. It has been successful in areas as diverse as workflows and Web services, security policies, AI planning, reasoning about actions, and more. Although a number of implementations of Transaction Logic exist, none is logically complete due to the inherent difficulty and time/space complexity of such implementations. In this paper we attack this problem by first introducing a logically complete tabling evaluation strategy for Transaction Logic and then describing a series of optimizations, which make this algorithm practical. In support of our arguments, we present a performance evaluation study of six different implementations of this algorithm, each successively adopting our optimizations. The study suggest that the tabling algorithm can scale well both in time and space. We also discuss ideas that could improve the performance further.