Abstract. An amalgamation base p in a simple theory is stably definable if its canonical base is interdefinable with the set of canonical parameters for the φ-definitions of p ...
Abstract: We present a new type of sat problem called the k-gd-sat, which generalizes k-sat and gd-sat. In k-gd-sat, clause lengths have geometric distribution, controlled by a pro...
Milena Vujosevic-Janicic, Jelena Tomasevic, Predra...
Abstract. Provision of personalized recommendations to users requires accurate modeling of their interests and needs. This paper proposes a general framework and specific methodolo...
Abstract. This paper presents a hybridization of a Constraint Programming (CP) model and search techniques with Local Search (LS) and some ideas borrowed from Genetic Algorithms (G...
Louis-Martin Rousseau, Gilles Pesant, Michel Gendr...
Elf is a general meta-language for the specification and implementation of logical systems in the style of the logical framework LF. Proof search in this framework is based on the...