Existentially quantified values for queries and updates of facts in transaction logic programs

Authors:
Paul Fodor
Affiliations:
Department of Computer Science, Stony Brook University, Stony Brook, NY
Venue:
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Year:
2008

Citing 3
Cited 0

An overview of transaction logic

Theoretical Computer Science - Special issue on formal methods in databases and software engineering
Logic based modeling and analysis of workflows

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving

Quantified Score

Hi-index	0.00

Visualization

Abstract

In several applications of logic programming and Transaction Logic, such as, planning, trust management and independent Semantic Web Services, an action might produce incomplete facts and leave existential values in an incrementally generated data structure. The same action or other producer or consumer actions might read, modify or communicate through these facts, making this technique a powerful communication technique. In this poster, we present a definite semantics for these existentially quantified values that occur only in facts, queries and updates of facts. Although this simple semantics applies only to facts and not to clauses, it is relevant to many applications, including artificial intelligence planning, workflow modeling and verification, and updates of facts in the Semantic Web.