3663 search results - page 219 / 733 » Problems in the ontology of computer programs |
175
click to vote
DBPL
2007
Springer
15 years 10 months ago
2007
Springer
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
159
click to vote
GECCO
2005
Springer
16 years 3 days ago
2005
Springer
We hypothesize that the relationship between parameter settings, speci cally parameters controlling mutation, and performance is non-linear in genetic programs. Genetic programmin...
216
click to vote
IFIP
2010
Springer
15 years 1 months ago
2010
Springer
This paper formalizes the semantics of trust and studies the transitivity of trust. On the Web, people and software agents have to interact with "strangers". This makes ...
180
click to vote
HYBRID
2010
Springer
16 years 1 months ago
2010
Springer
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...
166
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We study active integrity constraints and revision programming, two formalisms designed to describe integrity constraints on databases and to specify policies on preferred ways to...