Sciweavers

1670 search results - page 214 / 334
» On Skolemization in constructive theories
Sort
View
HEURISTICS
2006
102views more  HEURISTICS 2006»
15 years 6 months ago
A logic of soft constraints based on partially ordered preferences
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...
Nic Wilson
JAIR
2006
110views more  JAIR 2006»
15 years 6 months ago
Modelling Mixed Discrete-Continuous Domains for Planning
In this paper we present pddl+, a planning domain description language for modelling mixed discrete-continuous planning domains. We describe the syntax and modelling style of pddl...
Maria Fox, Derek Long
ECCC
2007
123views more  ECCC 2007»
15 years 6 months ago
Lossy Trapdoor Functions and Their Applications
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
Chris Peikert, Brent Waters
INFORMATICALT
2007
127views more  INFORMATICALT 2007»
15 years 6 months ago
Composition of Loop Modules in the Structural Blanks Approach to Programming with Recurrences: A Task of Synthesis of Nested Loo
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
Vytautas Cyras
CORR
2004
Springer
119views Education» more  CORR 2004»
15 years 6 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham