A Comprehensive Framework for Saturation Theorem Proving

Applications of Formalized Information Theory

Formalized Probability Theory and Applications Using Theorem Proving ◽

10.4018/978-1-4666-8315-0.ch011 ◽

2015 ◽

pp. 159-178

Keyword(s):

Information Theory ◽

Data Compression ◽

Theorem Proving ◽

Formal Analysis ◽

Theoretic Analysis ◽

Information Theoretic ◽

Wide Range ◽

Comprehensive Framework

In previous chapters, the authors provided a comprehensive framework that can be used in the formal probabilistic and information-theoretic analysis of a wide range of systems and protocols. In this chapter, they illustrate the usefulness of conducting this analysis using theorem proving by tackling a number of applications including a data compression application, the formal analysis of an anonymity-based MIX channel, and the properties of the onetime pad encryption system.

Download Full-text

Probabilistic Analysis Using Theorem Proving

Formalized Probability Theory and Applications Using Theorem Proving ◽

10.4018/978-1-4666-8315-0.ch003 ◽

2015 ◽

pp. 21-28

Keyword(s):

Model Checking ◽

Theorem Proving ◽

Probabilistic Analysis ◽

Probabilistic Model ◽

Higher Order ◽

Order Logic ◽

Theorem Prover ◽

Probabilistic Model Checking ◽

Higher Order Logic ◽

Comprehensive Framework

In this chapter, the authors first provide the overall methodology for the theorem proving formal probabilistic analysis followed by a brief introduction to the HOL4 theorem prover. The main focus of this book is to provide a comprehensive framework for formal probabilistic analysis as an alternative to less accurate techniques like simulation and paper-and-pencil methods and to other less scalable techniques like probabilistic model checking. For this purpose, the HOL4 theorem prover, which is a widely used higher-order-logic theorem prover, is used. The main reasons for this choice include the availability of foundational probabilistic analysis formalizations in HOL4 along with a very comprehensive support for real and set theoretic reasoning.

Download Full-text

ON THE ALGORITHM TO REALIZE THEOREM PROVING AND SOLVING PROBLEM

Acta Mathematica Scientia ◽

10.1016/s0252-9602(18)30579-4 ◽

1982 ◽

Vol 2 (4) ◽

pp. 459-464

Author(s):

Xianchang Zeng

Keyword(s):

Theorem Proving

Download Full-text

Communicating the Value of Design

Conference Proceedings of the Academy for Design Innovation Management ◽

10.33114/adim.2019.04.184 ◽

2019 ◽

Vol 2 (1) ◽

Author(s):

George Edward TORRENS ◽

Nicholas Samuel JOHNSON ◽

Ian STORER

Keyword(s):

Design Decision ◽

Card Sorting ◽

Practical Application ◽

Product Packaging ◽

Sorting Method ◽

Packaging Design ◽

Design Considerations ◽

Modified Delphi ◽

Fast Moving Consumer Goods ◽

Comprehensive Framework

Product packaging design is often produced through the practical application of tacit knowledge, rule of thumb and professional connoisseurship. Stakeholders are becoming increasingly demanding that design practitioners provide clarity of reasoning and accountability for their design proposals. Therefore, a better framework for the design of fast-moving consumer goods (FMCG) is required. This paper proposes a comprehensive taxonomy of ‘design considerations’ to assist the development of low involvement FMCG packaging and aid in rationale communication for design solutions. 302 academic sources were reviewed, inductive content analysis performed to code topics and output validation with academic and industry experts (n=9) through a modified-Delphi card sorting method. The research provides movement towards a comprehensive framework and common dialogue between stakeholders, practitioners and managers to assist in more effectively communicating the value that design can offer to FMCGs. The constructed taxonomy provides a set of 156 ‘design considerations’ to support in objective and informed design decision-making.

Download Full-text

Logic Control via Automatic Theorem Proving: COCOLOG Fragments Implemented in Blitzensturm 5.0

1993 American Control Conference ◽

10.23919/acc.1993.4793060 ◽

1993 ◽

Cited By ~ 1

Author(s):

P.E. Caines ◽

T. Mackling ◽

Y.J. Wei

Keyword(s):

Theorem Proving ◽

Automatic Theorem Proving ◽

Logic Control ◽

Automatic Theorem

Download Full-text

Creating autonomous learners in the teaching of English as a second language (ESL) in Zimbabwean secondary schools : a reality or a myth?

Journal of African Languages and Literary Studies ◽

10.31920/2633-2116/2020/v1n3a6 ◽

2020 ◽

Vol 1 (3) ◽

pp. 103-132

Author(s):

Rungamirai Matiure ◽

Erick Nyoni

Keyword(s):

Decision Making ◽

Second Language ◽

Multiple Case Study ◽

Document Analysis ◽

Learner Autonomy ◽

Case Study Design ◽

Midlands Province ◽

Multiple Case ◽

Comprehensive Framework

This study explored the utility of the learner autonomy concept in the Zimbabwean O Level English as a Second Language (ESL) classroom focusing on three Gweru urban high schools of the Midlands Province. The researchers intended to establish whether learner autonomy was a reality or just a myth in Zimbabwean classrooms. A qualitative multiple case study design was applied focusing on teaching strategies, availability of resources, challenges faced and ways of optimising it. Questionnaires and document analysis were used for data collection. The findings revealed that the concept did not manifest in explicit terms, the learners did not participate in decision making, and the teachers were not adequately prepared to administer autonomous processes with students. For it to be a reality, the Education Ministry is recommended to establish a comprehensive framework of how autonomous learning should be implemented. Teacher training should explicitly focus on how to develop autonomous learners. Teachers ought to be flexible enough to accommodate learners' contributions towards their learning.

Download Full-text