322 search results - page 15 / 65 » Combinations of Abstract Domains for Logic Programming |
155
Voted
ASP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We integrate an expressive class of description logics (DLs) and answer set programming by extending the latter to support inverted predicates and infinite domains, feat...
122
Voted
FM
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us t...
137
Voted
TPHOL
1999
IEEE
15 years 8 months ago
1999
IEEE
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We have constructed a syst...
124
Voted
CORR
2000
Springer
15 years 3 months ago
2000
Springer
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
160
Voted
PODS
1991
ACM
15 years 7 months ago
1991
ACM
d Abstract Kirack Sohn and Allen Van Gelder University of California, Santa Cruz Progress on automated termination detection for logic programs is reported. The prospects for han...