203 search results - page 11 / 41 » Exponentiable morphisms of domains |
IJCAI
1993
13 years 9 months ago
1993
Traditional algorithms for prime implicate generation [Quine, 1952; McCluskey, 1956; Tison, 1967; Kean and Tsiknis, 1990; de Kleer, 1992] require the input formulas to be first tr...
CP
2010
Springer
13 years 6 months ago
2010
Springer
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
FFA
2010
13 years 6 months ago
2010
Let Fq be a finite field with q elements and p ∈ Fq[X, Y ]. In this paper we study properties of additive functions with respect to number systems which are defined in the rin...
AAAI
2008
13 years 10 months ago
2008
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
Abramsky’s logical formulation of domain theory is extended to encompass the domain theoretic model for picalculus processes of Stark and of Fiore, Moggi and Sangiorgi. This is ...