Paper Info
Title
Abstract fixpoint semantics and abstract procedural semantics of definite logic programs
Abstract
A class of abstract interpretations of definite logic programs are discussed that are characterized by stable abstraction functions and a procedural characterization of the abstract fixpoint semantics is given. The authors give the notion of partial unification and define abstract fixpoint semantics. They then define a partial SLD resolution procedure over the concrete domain and relate it to the abstract fixpoint semantics by proving its soundness and completeness. They generalize the partial SLD resolution procedure, resulting in an abstract SLD resolution procedure over the abstract domain. They illustrate the computation of the abstract fixpoint semantics for depth abstractions and the application of the abstract SLD resolution procedure
Year
DOI
Venue
1992
10.1109/ICCL.1992.185477
ICCL
Keywords
Field
DocType
abstract interpretations,procedural characterization,partial sld resolution procedure,completeness,abstract sld resolution procedure,depth abstractions,abstract fixpoint semantics,definite logic programs,soundness,partial unification,formal logic,logic programming,concrete domain,stable abstraction functions,system monitoring,computer science,logic,solids,computational modeling,concrete
Modal μ-calculus,SLD resolution,Programming language,Computer science,Unification,Stable model semantics,Logic programming,Soundness,Well-founded semantics,Semantics
Conference
ISBN
Citations 
PageRank 
0-8186-2585-6
2
0.39
References 
Authors
7
2
Name
Order
Citations
PageRank
Lunjin Lu122926.40
Peter Greenfield2278.03