Sciweavers

114 search results - page 9 / 23
» Interactive Proof Systems with Polynomially Bounded Strategi...
Sort
View
COGSYS
2005
Springer
13 years 9 months ago
Natural Language Dialog with a Tutor System for Mathematical Proofs
Abstract. Natural language interaction between a student and a tutoring or an assistance system for mathematics is a new multi-disciplinary challenge that requires the interaction ...
Christoph Benzmüller, Helmut Horacek, Ivana K...
CSL
2006
Springer
13 years 11 months ago
Logical Omniscience Via Proof Complexity
The Hintikka-style modal logic approach to knowledge has a well-known defect of logical omniscience, i.e., an unrealistic feature that an agent knows all logical consequences of he...
Sergei N. Artëmov, Roman Kuznets
ASIAN
2006
Springer
133views Algorithms» more  ASIAN 2006»
13 years 11 months ago
Normal Proofs in Intruder Theories
Given an arbitrary intruder deduction capability, modeled as an inference system S and a protocol, we show how to compute an inference system bS such that the security problem for ...
Vincent Bernat, Hubert Comon-Lundh
CADE
2007
Springer
14 years 8 months ago
Combining Deduction and Algebraic Constraints for Hybrid System Analysis
We show how theorem proving and methods for handling real algebraic constraints can be combined for hybrid system verification. In particular, we highlight the interaction of deduc...
André Platzer
ARITH
2005
IEEE
14 years 1 months ago
Guaranteed Proofs Using Interval Arithmetic
This paper presents a set of tools for mechanical reasoning of numerical bounds using interval arithmetic. The tools implement two techniques for reducing decorrelation: interval ...
Marc Daumas, Guillaume Melquiond, César Mu&...