120 search results - page 12 / 24 » First Order Logic with Domain Conditions |
186
click to vote
CAV
2009
Springer
16 years 7 months ago
2009
Springer
Quantifier reasoning in Satisfiability Modulo Theories (SMT) is a long-standing challenge. The practical method employed in modern SMT solvers is to instantiate quantified formulas...
195
click to vote
LOGCOM
2002
15 years 6 months ago
2002
We present a logical approach to plan recognition that builds on Kautz's theory of keyhole plan recognition, defined as the problem of inferring descriptions of high-level pl...
193
click to vote
ACMICEC
2005
ACM
16 years 7 hour ago
2005
ACM
In order to capture the full fledge semantic of complicated product data model, the expressive language ALCNHR+ K(D) is introduced. It cannot only be able to represent knowledge a...
149
Voted
ENC
2005
IEEE
16 years 1 days ago
2005
IEEE
This paper describes SKIMA, a mediation system that gives transparent access to heterogeneous and distributed sources considering their semantics and the semantics of application ...
172
Voted
SEMCO
2007
IEEE
16 years 21 days ago
2007
IEEE
Many recent advances in complex domains such as Natural Language Processing (NLP) have taken a discriminative approach in conjunction with the global application of structural and...