7167 search results - page 283 / 1434 » Answer Set Programming |
134
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
140
Voted
LPNMR
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. Revision programming was introduced as a formalism to describe and enforce updates of belief sets and databases. Revision programming was extended by Fitting who assigned...
118
Voted
IANDC
2006
15 years 2 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
WILF
2005
Springer
15 years 8 months ago
2005
Springer
A prospective study of the use of ordered multi-lattices as underlying sets of truth-values for a generalised framework of logic programming is presented. Specifically, we investi...
123
Voted
TLCA
1993
Springer
15 years 6 months ago
1993
Springer
This paper describes formalizations of Tait’s normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs p...