Sciweavers

1322 search results - page 115 / 265
» Unsound Theorem Proving
Sort
View
COCO
2004
Springer
133views Algorithms» more  COCO 2004»
14 years 3 months ago
Parameterized Complexity of Constraint Satisfaction Problems
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...
Dániel Marx
DIAGRAMS
2004
Springer
14 years 3 months ago
An Experimental Comparison of Diagrammatic and Algebraic Logics
Abstract. We have developed a diagrammatic logic for theorem proving, focusing on the domain of metric-space analysis (a geometric domain, but traditionally taught using a dry alge...
Daniel Winterstein, Alan Bundy, Corin A. Gurr, Mat...
MKM
2009
Springer
14 years 2 months ago
Formal Proof: Reconciling Correctness and Understanding
Hilbert’s concept of formal proof is an ideal of rigour for mathematics which has important applications in mathematical logic, but seems irrelevant for the practice of mathemati...
Cristian S. Calude, Christine Müller
FASE
2001
Springer
14 years 2 months ago
A Logic for the Java Modeling Language JML
Abstract. This paper describes a specialised logic for proving specifications in the Java Modeling Language (JML). JML is an interface specification language for Java. It allows ...
Bart Jacobs, Erik Poll
LPAR
2001
Springer
14 years 2 months ago
A Computer Environment for Writing Ordinary Mathematical Proofs
The EPGY Theorem-Proving Environment is designed to help students write ordinary mathematical proofs. The system, used in a selection of computer-based proof-intensive mathematics ...
David McMath, Marianna Rozenfeld, Richard Sommer