Sciweavers

1888 search results - page 34 / 378
» Proof theory and computational analysis
Sort
View
JAR
2007
104views more  JAR 2007»
13 years 7 months ago
Student Proof Exercises Using MathsTiles and Isabelle/HOL in an Intelligent Book
The Intelligent Book project aims to improve online education by designing materials that can model the subject matter they teach, in the manner of a Reactive Learning Environment...
William Billingsley, Peter Robinson
PEPM
2010
ACM
13 years 9 months ago
A3PAT, an approach for certified automated termination proofs
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
Evelyne Contejean, Andrey Paskevich, Xavier Urbain...
JACM
2010
116views more  JACM 2010»
13 years 5 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára
TPHOL
2002
IEEE
14 years 8 days ago
The 5 Colour Theorem in Isabelle/Isar
Based on an inductive definition of triangulations, a theory of undirected planar graphs is developed in Isabelle/HOL. The proof of the 5 colour theorem is discussed in some detai...
Gertrud Bauer, Tobias Nipkow
AAAI
1994
13 years 8 months ago
Soundness and Completeness of a Logic Programming Approach to Default Logic
We present a method of representing some classes of default theories as normal logic programs. The main point is that the standard semantics (i.e. SLDNF-resolution) computes answe...
Grigoris Antoniou, Elmar Langetepe