Visualising reasoning: What ATP can learn from CP

John Slaney

doi:10.1016/j.entcs.2012.06.006

Visualising reasoning: What ATP can learn from CP

John Slaney^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

Abstract

Tools for graphical representation of problems in automated deduction or of proof searches are rare and mostly primitive. By contrast, there is a more substantial history of work in the constraint programming community on information visualisation techniques for helping programmers and end users to understand problems, searches and solutions. Here we consider the extent to which concepts and tools from a constraint programming platform can be adapted for use with automatic theorem provers.

Original language	English
Pages (from-to)	57-70
Number of pages	14
Journal	Electronic Notes in Theoretical Computer Science
Volume	285
DOIs	https://doi.org/10.1016/j.entcs.2012.06.006
Publication status	Published - 19 Sept 2012

Access to Document

10.1016/j.entcs.2012.06.006

Cite this

@article{c4391b9d0c5b41e1b802560491623f76,

title = "Visualising reasoning: What ATP can learn from CP",

abstract = "Tools for graphical representation of problems in automated deduction or of proof searches are rare and mostly primitive. By contrast, there is a more substantial history of work in the constraint programming community on information visualisation techniques for helping programmers and end users to understand problems, searches and solutions. Here we consider the extent to which concepts and tools from a constraint programming platform can be adapted for use with automatic theorem provers.",

keywords = "automated reasoning, visualisation",

author = "John Slaney",

year = "2012",

month = sep,

day = "19",

doi = "10.1016/j.entcs.2012.06.006",

language = "English",

volume = "285",

pages = "57--70",

journal = "Electronic Notes in Theoretical Computer Science",

issn = "1571-0661",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Visualising reasoning

T2 - What ATP can learn from CP

AU - Slaney, John

PY - 2012/9/19

Y1 - 2012/9/19

N2 - Tools for graphical representation of problems in automated deduction or of proof searches are rare and mostly primitive. By contrast, there is a more substantial history of work in the constraint programming community on information visualisation techniques for helping programmers and end users to understand problems, searches and solutions. Here we consider the extent to which concepts and tools from a constraint programming platform can be adapted for use with automatic theorem provers.

AB - Tools for graphical representation of problems in automated deduction or of proof searches are rare and mostly primitive. By contrast, there is a more substantial history of work in the constraint programming community on information visualisation techniques for helping programmers and end users to understand problems, searches and solutions. Here we consider the extent to which concepts and tools from a constraint programming platform can be adapted for use with automatic theorem provers.

KW - automated reasoning

KW - visualisation

UR - http://www.scopus.com/inward/record.url?scp=84866379003&partnerID=8YFLogxK

U2 - 10.1016/j.entcs.2012.06.006

DO - 10.1016/j.entcs.2012.06.006

M3 - Article

SN - 1571-0661

VL - 285

SP - 57

EP - 70

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

ER -

Visualising reasoning: What ATP can learn from CP

Abstract

Access to Document

Other files and links

Fingerprint

Cite this