Sciweavers

3353 search results - page 116 / 671
» Laver and set theory
Sort
View
LOGCOM
2002
142views more  LOGCOM 2002»
14 years 9 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
HICSS
2005
IEEE
133views Biometrics» more  HICSS 2005»
15 years 3 months ago
Identifying Facilitators and Inhibitors of Market Structure Change: A Hybrid Theory of Unbiased Electronic Markets
The electronic markets hypothesis (EMH) in the information systems (IS) literature suggests that information technology (IT) will reduce coordination costs across firms, leading t...
Nelson F. Granados, Alok Gupta, Robert J. Kauffman
DAC
2006
ACM
15 years 11 months ago
Predicate learning and selective theory deduction for a difference logic solver
Design and verification of systems at the Register-Transfer (RT) or behavioral level require the ability to reason at higher levels of abstraction. Difference logic consists of an...
Chao Wang, Aarti Gupta, Malay K. Ganai
ICLP
2009
Springer
15 years 10 months ago
Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
Miroslaw Truszczynski
COCO
2007
Springer
75views Algorithms» more  COCO 2007»
15 years 4 months ago
On the Theory of Matchgate Computations
Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this n...
Jin-yi Cai, Vinay Choudhary, Pinyan Lu