Sciweavers

240 search results - page 22 / 48
» Constrained Partial Deduction
Sort
View
CADE
2005
Springer
14 years 7 months ago
The Decidability of the First-Order Theory of Knuth-Bendix Order
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
Ting Zhang, Henny B. Sipma, Zohar Manna
PCI
2005
Springer
14 years 1 months ago
A Graphical Rule Authoring Tool for Defeasible Reasoning in the Semantic Web
Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is useful for many applications in the Semantic W...
Nick Bassiliades, Efstratios Kontopoulos, Grigoris...
EACL
1993
ACL Anthology
13 years 9 months ago
LFG Semantics via Constraints
Semantic theories of natural language associate meanings with utterances by providing meanings for lexical items and rules for determining the meaning of larger units given the me...
Mary Dalrymple, John Lamping, Vijay A. Saraswat
AI50
2006
13 years 11 months ago
Adaptive Multi-modal Sensors
Compressing real-time input through bandwidth constrained connections has been studied within robotics, wireless sensor networks, and image processing. When there are bandwidth con...
Kyle Ira Harrington, Hava T. Siegelmann
JSAC
2011
82views more  JSAC 2011»
13 years 2 months ago
Optimal Cognitive Access of Markovian Channels under Tight Collision Constraints
Abstract—The problem of cognitive access of channels of primary users by a secondary user is considered. The transmissions of primary users are modeled as independent continuous-...
Xin Li, Qianchuan Zhao, Xiaohong Guan, Lang Tong