10997 search results - page 286 / 2200 » On the Structure of Complete Sets |
188
click to vote
EACL
2009
ACL Anthology
16 years 7 months ago
2009
ACL Anthology
We present novel parsing algorithms for several sets of mildly non-projective dependency structures. First, we define a parser for well-nested structures of gap degree at most 1, ...
180
click to vote
VL
2007
IEEE
16 years 1 months ago
2007
IEEE
Description logics (DLs) are a well-understood family of knowledge representation (KR) languages. The notation of DLs has the flavour of a variable-free first order predicate lo...
171
click to vote
SAT
2004
Springer
16 years 4 days ago
2004
Springer
We define a collection of mappings that transform many-valued clausal forms into satisfiability equivalent Boolean clausal forms, analyze their complexity and evaluate them empir...
180
click to vote
AAAI
2004
15 years 8 months ago
2004
Clark's completion is a simple nonmonotonic formalism and a special case of several nonmonotonic logics. Recently there has been work on extending completion with "loop ...
200
click to vote
UAI
2001
15 years 8 months ago
2001
We present a propositional logic to reason about the uncertainty of events, where the uncertainty is modeled by a set of probability measures assigning an interval of probability ...