Results 11  20
of
133
Transforming and Analyzing Proofs in the CERESsystem
"... Cutelimination is the most prominent form of proof transformation in logic. The elimination of cuts in formal proofs corresponds to the removal of intermediate statements (lemmas) in mathematical proofs. Cutelimination can be applied to mine real mathematical proofs, i.e. for extracting explicit a ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Cutelimination is the most prominent form of proof transformation in logic. The elimination of cuts in formal proofs corresponds to the removal of intermediate statements (lemmas) in mathematical proofs. Cutelimination can be applied to mine real mathematical proofs, i.e. for extracting explicit
The Complexity of Mining Maximal Frequent Itemsets and Maximal Frequent Patterns
 In KDD ’04: Proceedings of the tenth ACM SIGKDD International Conference on Knowledge Discovery and Data mining
, 2004
"... Mining maximal frequent itemsets is one of the most fundamental problems in data mining. In this paper we study the complexitytheoretic aspects of maximal frequent itemset mining, from the perspective of counting the number of solutions. We present the first formal proof that the problem of countin ..."
Abstract

Cited by 50 (0 self)
 Add to MetaCart
Mining maximal frequent itemsets is one of the most fundamental problems in data mining. In this paper we study the complexitytheoretic aspects of maximal frequent itemset mining, from the perspective of counting the number of solutions. We present the first formal proof that the problem
Automated and human proofs in general mathematics: An initial comparison
 Logic for Programming, Artificial Intelligence, and Reasoning (LPAR18), Lecture Notes in Computer Science
, 2012
"... Abstract. Firstorder translations of large mathematical repositories allow discovery of new proofs by automated reasoning systems. Large amounts of available mathematical knowledge can be reused by combined AI/ATP systems, possibly in unexpected ways. But automated systems can be also more easi ..."
Abstract

Cited by 9 (9 self)
 Add to MetaCart
easily misled by irrelevant knowledge in this setting, and finding deeper proofs is typically more difficult. Both largetheory AI/ATP methods, and translation and datamining techniques of large formal corpora, have significantly developed recently, providing enough data for an initial comparison
Recycling Proof Patterns in Coq: Case Studies
 Journal Mathematics in Computer Science, accepted
, 2014
"... Abstract. Development of Interactive Theorem Provers has led to the creation of big libraries and varied infrastructures for formal proofs. However, despite (or perhaps due to) their sophistication, the reuse of libraries by nonexperts or across domains is a challenge. In this paper, we provide de ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. Development of Interactive Theorem Provers has led to the creation of big libraries and varied infrastructures for formal proofs. However, despite (or perhaps due to) their sophistication, the reuse of libraries by nonexperts or across domains is a challenge. In this paper, we provide
Mining eclipse for crosscutting concerns
 In Proceedings of the International Workshop on Mining Software Repositories (MSR 2006
, 2006
"... ABSTRACT Software may contain functionality that does not align with its architecture. Such crosscutting concerns do not exist from the beginning but emerge over time. By analysing where developers add code to a program, our historybased mining identifies crosscutting concerns in a twostep proc ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
step process. First, we mine CVS archives for sets of methods where a call to a specific single method was added. In a second step, such simple crosscutting concerns are combined to complex crosscutting concerns. To compute these efficiently, we apply formal concept analysisan algebraic theory. History
Available from the IACR Cryptology ePrint Archive as Report 2008/428. Randomizable Proofs and
, 2009
"... We construct an efficient delegatable anonymous credentials system. Users can anonymously and unlinkably obtain credentials from any authority, delegate their credentials to other users, and prove possession of a credential L levels away from a given authority. The size of the proof (and time to com ..."
Abstract
 Add to MetaCart
credentials and identify randomizable zeroknowledge proof of knowledge systems as the key building block. We formally define the notion of randomizable noninteractive zeroknowledge proofs, and give the first instance of controlled rerandomization of noninteractive zeroknowledge proofs by a third
Formalization of Formal Topology by means of the interactive theorem prover Matita
 Proceedings CICM 2011
, 2011
"... The project entitled “Formalization of Formal Topology by means of the interactive theorem prover Matita ” is an official bilateral project between the Universities of Padova and Bologna, funded by the former, active ¡¡¡¡¡¡ ¡.mine from march 2008 until august 2010. The project brought together and e ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The project entitled “Formalization of Formal Topology by means of the interactive theorem prover Matita ” is an official bilateral project between the Universities of Padova and Bologna, funded by the former, active ¡¡¡¡¡¡ ¡.mine from march 2008 until august 2010. The project brought together
Understanding, formal verification, and the philosophy of mathematics
, 2010
"... The philosophy of mathematics has long been concerned with determining the means that are appropriate for justifying claims of mathematical knowledge, and the metaphysical considerations that render them so. But, as of late, many philosophers have called attention to the fact that a much broader ra ..."
Abstract
 Add to MetaCart
of computer science known as “formal verification,” the practice of interactive theorem proving has given rise to software tools and systems designed to support the development of complex formal axiomatic proofs. Such efforts require one to develop models of mathematical language and inference that are more
Evaluation of the qmatrix method in understanding student logic proofs
 examinee). SIGKDD Explorations Volume 13, Issue 2 Page 35 Goebel, editors, Proceedings of the Nineteenth International Florida Artificial Intelligence Research Society Conference
"... In building intelligent tutoring systems, it is critical to be able to understand and diagnose student responses in interactive problem solving. We present a novel application of the qmatrix method, an educational data mining technique, to the problem of analyzing formal proofs. Our results indicat ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
In building intelligent tutoring systems, it is critical to be able to understand and diagnose student responses in interactive problem solving. We present a novel application of the qmatrix method, an educational data mining technique, to the problem of analyzing formal proofs. Our results
Rührmair: Physical Unclonable Functions in Cryptographic Protocols: Security Proofs and Impossibility Results. Cryptology ePrint Archive, Report 2012/228
, 2012
"... We investigate the power of physical unclonable functions (PUFs) as a new primitive in cryptographic protocols. Our contributions split into three parts. Firstly, we focus on the realizability of PUFprotocols in a special type of standalone setting (the “standalone, good PUF setting”) under minim ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
are partly new, and have certain practicality and security advantages compared to existing schemes. In the second part of the paper, we formally prove that there are very sharp limits on the usability of PUFs for OT and KE beyond the above standalone, good PUF scenario. We introduce two new and realistic
Results 11  20
of
133