Online Justification for Tabled Logic Programs

Pemmasani, Giridhar; Guo, Hai-Feng; Dong, Yunbai; Ramakrishnan, C. R.; Ramakrishnan, I. V.

doi:10.1007/978-3-540-24599-5_42

Cited by 6 publications

(14 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the underlying evaluation typically provides little or no information as to why the conclusion was reached. In [23] we proposed an efficient justifier to provide evidence, in terms of proof, for the truth value of the result generated by query evaluation of a tabled logic program. The justification is based on program transformation.…”

Section: Evaluation and Justificationmentioning

confidence: 99%

“…The result of justification is in the form of evidence trees [23], which reflect the derivation relation between the subgoals represented by the literals. For the S-matching problem, the justification results contain sufficient information, which can be converted later to the adapter.…”

Section: Evaluation and Justificationmentioning

confidence: 99%

“…XSB has already been used for building efficient model checkers [26] and bisimulation checkers [4]. More importantly, the XSB system provides a justifier [23], which essentially constructs concise evidence or debugging information to support the results of query evaluation. This justifier, with tabled logic programming, can be easily extended to provide an attractive platform for encoding computational problems, such as component matching and adaptation, in the specification and verification of systems.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Precise specification matching for adaptive reuse in embedded systems

Guo

Liu

Roop

et al. 2007

Journal of Applied Logic

Self Cite

View full text Add to dashboard Cite

Specification matching is a key to reuse of components in embedded systems. Existing specification matching techniques for embedded systems are designed to match reactive behaviors using adaptive techniques to dynamically alter behaviors. However, correct specification matching demands both behavioral matching (that checks component adaptability) and functional matching (that ensures that proper functionality is reused). While approaches for behavioral matching exist, combined functional and behavioral matching during component reuse in embedded systems is lacking. This paper presents a precise specification matching, including both behavioral and functional matching. We introduce attributed labeled transition systems (ALTS) to formally specify component behavior and functionalities. Given ALTS of a new specification (a function F ) and an existing component (a device D), a new refinement relation from F to D, called an S-matching relation, is proposed for precise specification matching. The existence of an S-matching relation is also shown to be a necessary and sufficient condition for the existence of a correct adapter to adapt D to match F both behaviorally and functionally. Automated component adaptation is facilitated by a matching tool implemented in a tabled logic programming environment, which provides distinct advantages for rapid implementation. Practical examples are given to illustrate how the concrete adapter is derived automatically from specification matching.

show abstract

Section: Evaluation and Justificationmentioning

confidence: 99%

Section: Evaluation and Justificationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Precise specification matching for adaptive reuse in embedded systems

Guo

Liu

Roop

et al. 2007

Journal of Applied Logic

Self Cite

View full text Add to dashboard Cite

show abstract

“…The most relevant work is represented by the recent proposals in the field of justification of computed answers in logic programming. The proposals presented in [20,18] discuss the justification of computed answers obtained from logic programs with negation, under the well-founded semantics, 1 in the context of the tabling logic programming system XSB. They make use of XSB's existing tabling mechanisms to store information for the creation of a justification of the computed answer.…”

Section: Relevant Work About Debuggingmentioning

confidence: 99%

“…Justification [18,10,20] is the process of generating evidence, in terms of high-level proofs based on the answers (or models) produced during the computation. Therefore, justification plays an important role in manual and automatic verification, by providing a proof description if a given property holds; otherwise, it generates a counter-example, showing where the violation/conflict occurs in the system.…”

Section: Introductionmentioning

confidence: 99%

Justification and debugging of answer set programs in ASP

Elkhatib

Pontelli

Son

2005

Proceedings of the Sixth International Symposium on Automated Analysis-Driven Debugging

View full text Add to dashboard Cite

The paper extends the concept of justification to the context of Answer Set Programming-a recent paradigm that builds on the foundations of logic programming, answer set semantics, and non-monotonic reasoning. A justification describes the support for the truth value of each atom in an answer set of a logic program, and it can be employed as a tool for reasoning and debugging of answer set programs. The paper describes the implementation of the notion of justification in the ASP − PROLOG system along with some examples of its applications.

show abstract

On the Efficient Implementation of Mode-Directed Tabling

Santos

Rocha

2013

Practical Aspects of Declarative Languages

View full text Add to dashboard Cite

Mode-directed tabling is an extension to the tabling technique that supports the definition of modes for specifying how answers are inserted into the table space. In this paper, we focus our discussion on the efficient support for mode-directed tabling in the YapTab tabling system, which uses tries to implement the table space. We discuss 7 different modes and explain how we have extended and optimized YapTab's table space organization to provide engine support for them. Experimental results, in the context of benchmarks taking advantage of mode-directed tabling, show that our implementation compares favorably with the B-Prolog and XSB state-of-the-art tabling systems.

show abstract

Online Justification for Tabled Logic Programs

Cited by 6 publications

References 3 publications

Precise specification matching for adaptive reuse in embedded systems

Precise specification matching for adaptive reuse in embedded systems

Justification and debugging of answer set programs in ASP

On the Efficient Implementation of Mode-Directed Tabling

Contact Info

Product

Resources

About