Learn More
Tabled logic programming (LP) systems have been applied to elegantly and quickly solving very complex problems (e.g., model checking). However, techniques currently employed for incorporating tabling in an existing LP system are quite complex and require considerable change to the LP system. We present a simple technique for incorporating tabling in(More)
In this paper we present the theory and practice of co-logic programming (co-LP for brevity), a paradigm that combines both induc-tive and coinductive logic programming. Co-LP is a natural generalization of logic programming and coinductive logic programming, which in turn generalizes other extensions of logic programming, such as infinite trees, lazy(More)
Service-oriented computing (SOC) has emerged as the eminent market environment for sharing and reusing service-centric capabilities. The underpinning for an orga-nization's use of SOC techniques is the ability to discover and compose Web services. Although industry approaches to composition have a strong notion of business processes, these approaches(More)
Logic programming is a paradigm of programming based on a subset of rst order logic. An important property of logic programming languages, such as Prolog, is that their declarative semantics is largely independent of the order in which diierent operations are performed during execution of the program. The diierent operations can also be performed in(More)
We present a general framework for navigating complex structures— specifically, tables, frames, and forms—found in web-pages. Our framework is based on an (automatically or manually created) program written in a domain specific language that captures the semantic structure of the table/frame/form as well as specifies the strategy to be used for navigating(More)