1743 search results - page 28 / 349 » Generalized Modal Satisfiability |
93
Voted
ACL
2000
15 years 2 months ago
2000
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we...
85
Voted
ISBI
2009
IEEE
15 years 7 months ago
2009
IEEE
We address the difficult problem of segmenting the inflamed synovial tissue in multi-modal 3D MR sequences of the wrist. The complex morphology of the structures to segment, the...
JANCL
2008
15 years 23 days ago
2008
Consider any logical system, what is its natural repertoire of logical operations? This question has been raised in particular for first-order logic and its extensions with genera...
105
Voted
JOLLI
2006
15 years 22 days ago
2006
We propose a novel interpretation of natural-language questions using a modal predicate logic of knowledge. Our approach brings standard model-theoretic and proof-theoretic techniq...
123
click to vote
IGPL
2010
14 years 11 months ago
2010
Fusion is a well-known form of combining normal modal logics endowed with a Hilbert calculi and a Kripke semantics. Herein, fusion is studied over logic systems using sequent calc...