4617 search results - page 201 / 924 » Automation of Diagrammatic Reasoning |
239
click to vote
LPAR
2012
Springer
14 years 2 months ago
2012
Springer
We motivate and introduce a query language PrQL designed for inspecting machine representations of proofs. PrQL natively supports hiproofs which express proof structure using hiera...
213
click to vote
LICS
2012
IEEE
13 years 8 months ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
214
click to vote
LICS
2012
IEEE
13 years 8 months ago
2012
IEEE
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
154
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
Abstract. We introduce a semi-automated proof system for basic category-theoretic reasoning. It is based on a first-order sequent calculus that captures the basic properties of cat...
368
click to vote
DLOG
2011
14 years 10 months ago
2011
In this paper we present a formal framework and tool supporting the user in the task of formulating a precise query – which best captures their information needs – even in the ...