5378 search results - page 782 / 1076 » Base Logics in Argumentation |
111
Voted
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
97
Voted
ICML
2000
IEEE
16 years 1 months ago
2000
IEEE
This paper introduces a foundation for inductive learning based on the use of higher-order logic for knowledge representation. In particular, the paper (i) provides a systematic i...
87
Voted
SIGSOFT
2003
ACM
16 years 1 months ago
2003
ACM
Foundational and scalable techniques for runtime safety analysis of multithreaded programs are explored in this paper. A technique based on vector clocks to extract the causal dep...
95
Voted
WWW
2009
ACM
16 years 1 months ago
2009
ACM
In this paper, we propose a novel approach for composing existing web services to satisfy the correctness constraints to the design, including freeness of deadlock and unspecified...
103
click to vote
WWW
2007
ACM
16 years 1 months ago
2007
ACM
In XML databases, new schema versions may be released as frequently as once every two weeks. This poster describes a taxonomy of changes for XML schema evolution. It examines the ...