Sciweavers

58 search results - page 4 / 12
» Counterexamples to witness conjectures
Sort
View
FSTTCS
2004
Springer
14 years 2 months ago
Learning Languages from Positive Data and a Finite Number of Queries
A computational model for learning languages in the limit from full positive data and a bounded number of queries to the teacher (oracle) is introduced and explored. Equivalence, ...
Sanjay Jain, Efim B. Kinber
JCT
2008
96views more  JCT 2008»
13 years 8 months ago
Graphs with full rank 3-color matrix and few 3-colorings
We exhibit a a counterexample to a conjecture of Thomassen stating that the number of distinct 3-colorings of every graph whose 3color matrix has full column rank is superpolynomi...
Serguei Norine, Jean-Sébastien Sereni
JSYML
2007
80views more  JSYML 2007»
13 years 8 months ago
Theories very close to PA where Kreisel's Conjecture is false
We give four examples of theories in which Kreisel’s Conjecture is false: (1) the theory PA(-) obtained by adding a function symbol minus, ‘−’, to the language of PA, and t...
Pavel Hrubes
JAR
2006
107views more  JAR 2006»
13 years 8 months ago
Attacking Group Protocols by Refuting Incorrect Inductive Conjectures
Automated tools for finding attacks on flawed security protocols often fail to quately with group protocols. This is because the abstractions made to improve performance on fixed ...
Graham Steel, Alan Bundy
FSTTCS
2005
Springer
14 years 2 months ago
On the Expressiveness of TPTL and MTL
TPTL and MTL are two classical timed extensions of LTL. In this paper, we positively answer a 15-year-old conjecture that TPTL is strictly more expressive than MTL. But we show tha...
Patricia Bouyer, Fabrice Chevalier, Nicolas Markey