Sciweavers

284 search results - page 43 / 57
» On Reversible Combinatory Logic
Sort
View
FCSC
2010
108views more  FCSC 2010»
13 years 8 months ago
On the computation of quotients and factors of regular languages
Quotients and factors are important notions in the design of various computational procedures for regular languages and for the analysis of their logical properties. We propose a n...
Mircea Marin, Temur Kutsia
CEC
2008
IEEE
14 years 4 months ago
Fitness functions for the unconstrained evolution of digital circuits
— This work is part of a project that aims to develop and operate integrated evolvable hardware systems using unconstrained evolution. Experiments are carried out on an evolvable...
Tüze Kuyucu, Martin Trefzer, Andrew J. Greens...
AISC
2010
Springer
14 years 1 months ago
How to Correctly Prune Tropical Trees
We present tropical games, a generalization of combinatorial min-max games based on tropical algebras. Our model breaks the traditional symmetry of rational zero-sum games where pl...
Jean-Vincent Loddo, Luca Saiu
ECML
2006
Springer
14 years 1 months ago
Toward Robust Real-World Inference: A New Perspective on Explanation-Based Learning
Abstract. Over the last twenty years AI has undergone a sea change. The oncedominant paradigm of logical inference over symbolic knowledge representations has largely been supplant...
Gerald DeJong
APAL
2010
98views more  APAL 2010»
13 years 10 months ago
Classical proof forestry
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
Willem Heijltjes