Paper Info
Title
Conservative Query Normalization on Parallel Circumscription
Abstract
In this paper, we study a deductive computation for parallel circumscription based on query normalization. At first, we give two fundamental transformation rules M-resolution and V-resolution. M-resolution is an equivalent transformation rule for computing negative information upon circumscribed predicates occurring in queries. V-resolution is for computing variable predicates, and nearly conserves the satisfiability of queries. Next, we give Conservative Query (CQ) transformation rule by integrating M-resolution and V-resolution. CQ-transformation takes a general form of Negation as Failure rule in logic programming. It is applicable to parallel circumscription over an arbitrary first-order clausal theory. After we extend CQ-transformation by incorporating it with Robinson's resolution procedure, we discuss fundamental properties for high-speed execution based on compilation of CQ-transformation.
Year
DOI
Venue
1994
10.1007/3-540-58156-1_21
CADE
Keywords
Field
DocType
conservative query normalization,parallel circumscription,satisfiability,first order
Equivalent transformation,Discrete mathematics,Normalization (statistics),Computer science,Satisfiability,Algorithm,Theoretical computer science,Negation as failure,Circumscription,Logic programming,Predicate (grammar),Computation
Conference
ISBN
Citations 
PageRank 
3-540-58156-1
2
0.38
References 
Authors
9
1
Name
Order
Citations
PageRank
Koji Iwanuma113817.65