Sciweavers

4617 search results - page 271 / 924
» Automation of Diagrammatic Reasoning
Sort
View
CADE
2006
Springer
16 years 6 months ago
Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials
We describe here a formal proof in the Coq system of the structure theorem for subresultants, which allows to prove formally the correctness of our implementation of the subresulta...
Assia Mahboubi
CADE
2004
Springer
16 years 6 months ago
Formalizing O Notation in Isabelle/HOL
We describe a formalization of asymptotic O notation using the Isabelle/HOL proof assistant.
Jeremy Avigad, Kevin Donnelly
CP
2007
Springer
16 years 22 days ago
Constraint-Based Temporal Reasoning for E-Learning with LODE
LODE is a logic-based web tool for Italian deaf children. It aims at stimulating global reasoning on e-stories written in a verbal language. Presently, we are focusing on temporal ...
Rosella Gennari, Ornella Mich
CADE
2008
Springer
16 years 6 months ago
Individual Reuse in Description Logic Reasoning
Abstract. Tableau calculi are the state-of-the-art for reasoning in description logics (DL). Despite recent improvements, tableau-based reasoners still cannot process certain knowl...
Boris Motik, Ian Horrocks
CADE
2006
Springer
16 years 6 months ago
Description Logic Reasoner: System Description
This is a system description of the Description Logic reasoner FaCT++. The reasoner implements a tableaux decision procedure for the well known SHOIQ description logic, with additi...
Dmitry Tsarkov, Ian Horrocks