CiteSeerX — Logical Algorithms

Logical Algorithms (2002) [16 citations — 0 self]

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@MISC{Ganzinger02logicalalgorithms,
    author = {Harald Ganzinger and David Mcallester},
    title = {Logical Algorithms},
    year = {2002}
}

Years of Citing Articles

Bookmarks

OpenURL

Abstract:

It is widely accepted that many algorithms can be concisely and clearly expressed as logical inference rules. However, logic programming has been inappropriate for the study of the running time of algorithms because there has not been a clear and precise model of the run time of a logic program. We present a logic programming model of computation appropriate for the study of the run time of a wide variety of algorithms.

Citations

1122	The Stable Model Semantics for Logic Programming – GELFOND, LIFSCHITZ - 1988
441	The complexity of relational query languages – Vardi - 1982
187	Tabled evaluation with delaying for general logic programs – Chen, Warren - 1996
186	XSB as an Efficient Deductive Database Engine – Sagonas, Swift, et al. - 1994
178	OLDT resolution with tabulation – Tamaki, Sato - 1986
62	Bottom-up beats top-down for datalog – Ullman - 1989
61	On the declarative semantics of stratified deductive databases and logic programs – Przymusinski - 1988
42	On the complexity analysis of static analyses – McAllester - 1999
33	The expressive power of stratified logic programs – Kolaitis - 1991
28	XSB as an ecient deductive database engine – Sagonas, Swift, et al. - 1994
26	Ordered Linear Logic and Applications – Polakow - 2001
21	A new meta-complexity theorem for bottomup logic programs – Ganzinger, McAllester - 2001
16	Towards generalized rule-based updates – Zhang, Foo - 1997
1	and Raghu Ramakrishnan. A survey of research in deductive database systems – Ullman - 1995