1888 search results - page 34 / 378 » Proof theory and computational analysis |
137
Voted
JAR
2007
15 years 12 days ago
2007
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...
139
click to vote
PEPM
2010
ACM
15 years 2 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
117
Voted
JACM
2010
14 years 11 months ago
2010
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...
101
Voted
TPHOL
2002
IEEE
15 years 5 months ago
2002
IEEE
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...
AAAI
1994
15 years 1 months ago
1994
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...