Sciweavers

2308 search results - page 72 / 462
» Representing Symbolic Reasoning
Sort
View
182
Voted
AISC
1998
Springer
15 years 9 months ago
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
Clemens Ballarin, Lawrence C. Paulson
CADE
2007
Springer
16 years 5 months ago
MaLARea: a Metasystem for Automated Reasoning in Large Theories
MaLARea (a Machine Learner for Automated Reasoning) is a simple metasystem iteratively combining deductive Automated Reasoning tools (now the E and the SPASS ATP systems) with a m...
Josef Urban
FC
2010
Springer
169views Cryptology» more  FC 2010»
15 years 9 months ago
A Formal Approach for Automated Reasoning about Off-Line and Undetectable On-Line Guessing
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
Bogdan Groza, Marius Minea
EELC
2006
128views Languages» more  EELC 2006»
15 years 9 months ago
Evolving Distributed Representations for Language with Self-Organizing Maps
We present a neural-competitive learning model of language evolution in which several symbol sequences compete to signify a given propositional meaning. Both symbol sequences and p...
Simon D. Levy, Simon Kirby
CORR
2010
Springer
210views Education» more  CORR 2010»
15 years 5 months ago
Test Case Generation for Object-Oriented Imperative Languages in CLP
Testing is a vital part of the software development process. Test Case Generation (TCG) is the process of automatically generating a collection of test-cases which are applied to ...
Miguel Gómez-Zamalloa, Elvira Albert, Germ&...