Sciweavers

44 search results - page 6 / 9
» A Clausal Approach to Proof Analysis in Second-Order Logic
Sort
View
86
Voted
ECML
2006
Springer
15 years 1 months ago
(Agnostic) PAC Learning Concepts in Higher-Order Logic
This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higher-order logic setting introduced by Lloyd et al. In particular, i...
Kee Siong Ng
ICCAD
1996
IEEE
151views Hardware» more  ICCAD 1996»
15 years 1 months ago
Expected current distributions for CMOS circuits
The analysis of CMOS VLSI circuit switching current has become an increasingly important and difficult task from both a VLSI design and simulation software perspective. This paper...
Dennis J. Ciplickas, Ronald A. Rohrer
JCST
2010
189views more  JCST 2010»
14 years 4 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
AI
2000
Springer
14 years 9 months ago
Alternative foundations for Reiter's default logic
We introduce an alternative conceptual basis for default reasoning in Reiter's default logic. In fact, most formal or computational treatments of default logic suffer from th...
Thomas Linke, Torsten Schaub
88
Voted
WOLLIC
2010
Springer
15 years 2 months ago
On Anaphora and the Binding Principles in Categorial Grammar
In type logical categorial grammar the analysis of an expression is a resource-conscious proof. Anaphora represents a particular challenge to this approach in that the antecedent ...
Glyn Morrill, Oriol Valentín