Many analysis problems can be cast in the form of evaluating minimal models of a logic
program. Although such formulations are appealing due to their simplicity and …

SLG resolution uses tabling to evaluate nonfloundering normal logic pr ograms according to
the well-founded semantics. The SLG-WAM, which forms the engine of the XSB system, can …

Several program analysis problems can be cast elegantly as a logic program. In this paper
we show how recently-developed techniques for incremental evaluation of logic programs …

Term indexing | Handbook of automated reasoning skip to main content ACM Digital Library
home ACM home Google, Inc. (search) Advanced Search Browse About Sign in Register …

Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-
up starting with the facts or top-down starting with the query. The dominant strategies to …

Logic programming languages, such as Prolog, provide a high-level, declarative approach
to programming. Logic Programming offers great potential for implicit parallelism, thus …

Tabled resolution improves efficiency as well as termination properties of logic programs by
sharing answer computations across “similar” subgoals. Similarity based on subsumption of …

Tabled Constraint Logic Programming is a powerful execution mechanism for dealing with
Constraint Logic Programming without worrying about fixpoint computation. Various …

This paper describes a framework to combine tabling evaluation and constraint logic
programming (TCLP). While this combination has been studied previously from a theoretical …

Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-
up starting from the facts or top-down starting from the query. For efficiency, top-down …