XSB: Extending Prolog with Tabled Logic Programming

Swift, Terrance; Warren, David S.

doi:10.1017/s1471068411000500

Cited by 146 publications

(139 citation statements)

References 62 publications

Supporting

Mentioning

132

Contrasting

Unclassified

Order By: Relevance

“…4. Inference engine A Datalog evaluation engine is used as inference engine; in our case the XSB Prolog tabled logic programming system [52].…”

Section: Knowledge-base Systemmentioning

confidence: 99%

“…6. The XSB Prolog interpreter [52] was used as a back-end for the implementation as it offers tabled predicates which have the same characteristics as Datalog programs, while still allowing general Prolog expressions such as arithmetic operations.…”

Section: Tool Implementationmentioning

confidence: 99%

“…XSB Prolog, continuously developed since 1990, has constantly been pushing the state of the art in high-performance Prolog. XSB is especially known for its tabling support [52], which allows fast Datalog-like evaluation of logic programs without restricting ISO Prolog in any way. The tabling support was extended to allow incremental evaluation [47], and these features have been under continued development and seem to have reached a mature state [51].…”

Section: Tools and Performancementioning

confidence: 99%

See 2 more Smart Citations

Efficient verification of railway infrastructure designs against standard regulations

Luteberget

Johansen

2017

Form Methods Syst Des

View full text Add to dashboard Cite

In designing safety-critical infrastructures s.a. railway systems, engineers often have to deal with complex and large-scale designs. Formal methods can play an important role in helping automate various tasks. For railway designs formal methods have mainly been used to verify the safety of so-called interlockings through model checking, which deals with state change and rather complex properties, usually incurring considerable computational burden (e.g., the state-space explosion problem). In contrast, we focus on static infrastructure models, and are interested in checking requirements coming from design guidelines and regulations, as usually given by railway authorities or safety certification bodies. Our goal is to automate the tedious manual work that railway engineers do when ensuring compliance with regulations, through using software that is fast enough to do verification on-the-fly, thus being able to be included in the railway design tools, much like a compiler in an IDE. In consequence, this paper describes the integration into the railway design process of formal methods for automatically extracting railway models from the CAD railway designs and for describing relevant technical regulations and expert knowledge as properties to be checked on the models. We employ a variant of Datalog and use the standardized "railway markup language" railML as basis and exchange format for the formalization. We developed a prototype tool and integrated it in industrial railway CAD software, developed under the name RailCOMPLETE . This on-the-fly verification tool is a help for the engineer while doing the designs, and is not a replacement to other more heavy-weight software like for doing interlocking verification or capacity analysis. Our tool, through the export into railML, can be easily integrated with these other tools. We apply our tool chain in a Norwegian railway project, the upgrade of the Arna railway station.

show abstract

“…4. Inference engine A Datalog evaluation engine is used as inference engine; in our case the XSB Prolog tabled logic programming system [52].…”

Section: Knowledge-base Systemmentioning

confidence: 99%

Section: Tool Implementationmentioning

confidence: 99%

Section: Tools and Performancementioning

confidence: 99%

See 1 more Smart Citation

Efficient verification of railway infrastructure designs against standard regulations

Luteberget

Johansen

2017

Form Methods Syst Des

View full text Add to dashboard Cite

show abstract

“…We have already discussed the tabling modes of Yap (Santos and Rocha 2013) and XSB (Swift and Warren 2012) at length in Section 3.1. XSB's lattice based answer subsumption is more suitable for implementing techniques that require more general lattices than simple minimum and maximum, such as abstract interpretation.…”

Section: Related Workmentioning

confidence: 99%

“…Various tabling extensions (know collectively as answer subsumption: mode-directed tabling (Guo and Gupta 2004;Guo and Gupta 2008;Zhou et al 2010;Santos and Rocha 2013), partial order answer subsumption and lattice answer subsumption (Swift and Warren 2012)), have come up with ways to integrate the aggregation into the tabled resolution. This way answers are incrementally aggregated and the tabling may converge more quickly to the desired results.…”

Section: Introductionmentioning

confidence: 99%

Tabling with Sound Answer Subsumption

Vandenbroucke¹,

Piróg²,

Desouter³

et al. 2016

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

Tabling is a powerful resolution mechanism for logic programs that captures their least fixed point semantics more faithfully than plain Prolog. In many tabling applications, we are not interested in the set of all answers to a goal, but only require an aggregation of those answers. Several works have studied efficient techniques, such as lattice-based answer subsumption and mode-directed tabling, to do so for various forms of aggregation.While much attention has been paid to expressivity and efficient implementation of the different approaches, soundness has not been considered. This paper shows that the different implementations indeed fail to produce least fixed points for some programs. As a remedy, we provide a formal framework that generalises the existing approaches and we establish a soundness criterion that explains for which programs the approach is sound. This article is under consideration for acceptance in TPLP.

show abstract

Multi‐dimensional lock‐free arrays for multithreaded mode‐directed tabling in Prolog

Areias

Rocha

2018

Concurrency and Computation

View full text Add to dashboard Cite

Summary This work proposes a new design for the supporting data structures used to implement multithreaded tabling in Prolog systems. Tabling is an implementation technique that improves the expressiveness of traditional Prolog systems in dealing with recursion and redundant computations. Mode‐directed tabling is an extension to the tabling technique that supports the definition of alternative criteria for specifying how answers are aggregated, thus being very suitable for problems where the goal is to dynamically calculate optimal or selective answers. In this work, we leverage the intrinsic potential that mode‐directed tabling has to express dynamic programming problems by creating a new design that improves the representation of multi‐dimensional arrays in the context of multithreaded tabling. To do so, we introduce a new mode for indexing arguments in mode‐directed tabled evaluations, named dim, where each dim argument features a uni‐dimensional lock‐free array. Experimental results using well‐known dynamic programming problems on a 32‐core machine show that the new design introduces less overheads and clearly improves the execution time for sequential and multithreaded tabled evaluations.

show abstract

XSB: Extending Prolog with Tabled Logic Programming

Cited by 146 publications

References 62 publications

Efficient verification of railway infrastructure designs against standard regulations

Efficient verification of railway infrastructure designs against standard regulations

Tabling with Sound Answer Subsumption

Multi‐dimensional lock‐free arrays for multithreaded mode‐directed tabling in Prolog

Contact Info

Product

Resources

About