Sciweavers

641 search results - page 84 / 129
» Embedding Finite Sets in a Logic Programming Language
Sort
View
TCS
2008
13 years 8 months ago
Verification of qualitative Z constraints
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...
Stéphane Demri, Régis Gascon
GECCO
2003
Springer
117views Optimization» more  GECCO 2003»
14 years 1 months ago
A Method for Handling Numerical Attributes in GA-Based Inductive Concept Learners
This paper proposes a method for dealing with numerical attributes in inductive concept learning systems based on genetic algorithms. The method uses constraints for restricting th...
Federico Divina, Maarten Keijzer, Elena Marchiori
LISP
2008
154views more  LISP 2008»
13 years 8 months ago
Types and trace effects for object orientation
Trace effects are statically generated program abstractions, that can be model checked for verification of assertions in a temporal program logic. In this paper we develop a type a...
Christian Skalka
ICALP
2005
Springer
14 years 1 months ago
Weighted Automata and Weighted Logics
Abstract. Weighted automata are used to describe quantitative properties in various areas such as probabilistic systems, image compression, speech-to-text processing. The behaviour...
Manfred Droste, Paul Gastin
BIRTHDAY
2000
Springer
14 years 13 days ago
Prioritizing Default Logic
A number of prioritized variants of Reiter’s default logic have been described in the literature. In this paper, we introduce two natural principles for preference handling and s...
Gerhard Brewka, Thomas Eiter