Sciweavers

374 search results - page 30 / 75
» Modular Semantics and Logics of Classes
Sort
View
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
14 years 3 months ago
Approximating geometric crossover in semantic space
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
Krzysztof Krawiec, Pawel Lichocki
CSL
2010
Springer
13 years 9 months ago
Ordered Sets in the Calculus of Data Structures
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
Viktor Kuncak, Ruzica Piskac, Philippe Suter
TACAS
2010
Springer
160views Algorithms» more  TACAS 2010»
14 years 3 months ago
Optimal Tableau Algorithms for Coalgebraic Logics
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
Rajeev Goré, Clemens Kupke, Dirk Pattinson
AMAST
1998
Springer
14 years 28 days ago
Type Analysis for CHIP
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
Wlodzimierz Drabent, Pawel Pietrzak
SAC
2010
ACM
14 years 3 months ago
Towards the induction of terminological decision trees
A concept learning framework for terminological representations is introduced. It is grounded on a method for inducing logic decision trees as an adaptation of the classic tree in...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito