Sciweavers

120 search results - page 12 / 24
» First Order Logic with Domain Conditions
Sort
View
CAV
2009
Springer
163views Hardware» more  CAV 2009»
14 years 9 months ago
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
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...
Leonardo Mendonça de Moura, Yeting Ge
LOGCOM
2002
142views more  LOGCOM 2002»
13 years 8 months ago
Two Logical Theories of Plan Recognition
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...
Wayne Wobcke
ACMICEC
2005
ACM
151views ECommerce» more  ACMICEC 2005»
14 years 2 months ago
Product knowledge reasoning: a DL-based approach
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...
Nizamuddin Channa, Shanping Li, Xiangjun Fu
ENC
2005
IEEE
14 years 2 months ago
SKIMA: Semantic Knowledge and Information Management
This paper describes SKIMA, a mediation system that gives transparent access to heterogeneous and distributed sources considering their semantics and the semantics of application ...
Héctor Pérez-Urbina, Gennaro Bruno, ...
SEMCO
2007
IEEE
14 years 2 months ago
Modeling Discriminative Global Inference
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...
Nicholas Rizzolo, Dan Roth