AbstractTools 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
Spider diagrams are a visual notation for expressing logical statements. In this paper we describe a...
Backtracking CSP solvers provide a powerful framework for search and reasoning. The aim of constrain...
Automated reasoning or theorem proving essentially amounts to solving search problems. Despite sign...
AbstractTools for graphical representation of problems in automated deduction or of proof searches a...
AbstractWe describe an interactive visualization tool for large natural deduction proof searches. Th...
We address the design and implementation of visual paradigms for observing the execution of constrai...
Problems such as timetabling or personnel allocation can be modeled and solved using discrete constr...
We describe the design and implementation of a new constraint programming solver that can produce an...
The efficiency of systems for constraint programming (CP) is currently highly affected by the actual...
In this paper we present a general representation for constraint satisfaction problems (CSP) and a -...
A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one form...
The integration of constraint solvers into proof planning has pushed the problem solving horizon. Pr...
Visualization is probably the most powerful tool to help develop, test and improve Constraint Progra...
. The aim of this paper is to investigate two related aspects of human reasoning, and use the result...
Constraint diagrams are designed for the formal specification of software systems. However, their ap...
Spider diagrams are a visual notation for expressing logical statements. In this paper we describe a...
Backtracking CSP solvers provide a powerful framework for search and reasoning. The aim of constrain...
Automated reasoning or theorem proving essentially amounts to solving search problems. Despite sign...
AbstractTools for graphical representation of problems in automated deduction or of proof searches a...
AbstractWe describe an interactive visualization tool for large natural deduction proof searches. Th...
We address the design and implementation of visual paradigms for observing the execution of constrai...
Problems such as timetabling or personnel allocation can be modeled and solved using discrete constr...
We describe the design and implementation of a new constraint programming solver that can produce an...
The efficiency of systems for constraint programming (CP) is currently highly affected by the actual...
In this paper we present a general representation for constraint satisfaction problems (CSP) and a -...
A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one form...
The integration of constraint solvers into proof planning has pushed the problem solving horizon. Pr...
Visualization is probably the most powerful tool to help develop, test and improve Constraint Progra...
. The aim of this paper is to investigate two related aspects of human reasoning, and use the result...
Constraint diagrams are designed for the formal specification of software systems. However, their ap...
Spider diagrams are a visual notation for expressing logical statements. In this paper we describe a...
Backtracking CSP solvers provide a powerful framework for search and reasoning. The aim of constrain...
Automated reasoning or theorem proving essentially amounts to solving search problems. Despite sign...