Sciweavers

105 search results - page 1 / 21
» Verifying an Applicative ATP Using Multiset Relations
Sort
View
EUROCAST
2001
Springer
75views Hardware» more  EUROCAST 2001»
14 years 1 days ago
Verifying an Applicative ATP Using Multiset Relations
Francisco-Jesús Martín-Mateos, Jos&e...
ADG
2006
Springer
191views Mathematics» more  ADG 2006»
13 years 11 months ago
Automatic Verification of Regular Constructions in Dynamic Geometry Systems
We present an application of an automatic theorem proving (ATP) in the verification of constructions made with dynamic geometry software (DGS). Given a specification language for g...
Predrag Janicic, Pedro Quaresma
CAV
2009
Springer
133views Hardware» more  CAV 2009»
14 years 8 months ago
Cardinality Abstraction for Declarative Networking Applications
ity Abstraction for Declarative Networking Applications Juan A. Navarro P?erez, Andrey Rybalchenko, and Atul Singh Max Planck Institute for Software Systems (MPI-SWS) Declarative N...
Andrey Rybalchenko, Atul Singh, Juan Antonio Navar...
AAECC
2001
Springer
132views Algorithms» more  AAECC 2001»
14 years 2 days ago
Duality and Greedy Weights of Linear Codes and Projective Multisets
A projective multiset is a collection of projective points, which are not necessarily distinct. A linear code can be represented as a projective multiset, by taking the columns of ...
Hans Georg Schaathun
AIML
2008
13 years 9 months ago
Valentini's cut-elimination for provability logic resolved
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
Rajeev Goré, Revantha Ramanayake