scholarly journals The Efficiency of Automated Theorem Proving by Translation to Less Expressive Logics

10.29007/kvb1 ◽  
2018 ◽  
Author(s):  
Negin Arhami ◽  
Geoff Sutcliffe

Many Automated Theorem Prover (ATP) systems for different logics, andtranslators for translating different logics from one to another, havebeen developed and are now available.Some logics are more expressive than others, and it is easier to expressproblems in those logics.On the other hand, the ATP systems for less expressive logics have beenunder development for many years, and are more powerful and reliable.There is a trade-off between expressivity of a logic, and the power andreliability of the available ATP systems.Translators and ATP systems can be combined to try to solvea problem.In this research, an experiment has been carried out to compare theperformance of difference combinations of translators and ATP systems.

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Basit Ali ◽  
Muhammad Irfan

AbstractThe Government of Pakistan introduced smoking ordinance about health warning in 2009. This ordinance exhibits, prohibit smoking in public places, put restrictions on advertisements, and prohibits sale of cigarettes to minors. This study is to find out the impact of smoking expenditures on food, health, educational, recreational, and electronic expenditures using HIES dataset for 2010–11 and 2015–16. The findings show that share of food and health expenditure increase by 91 and 92% respectively. On the other hand, education and recreation expenditure decrease by 6 and 98% respectively. This is further verified using SUEST test to compare two datasets regressions. The result reveals that food, health, and recreational coefficient are statistically different while education and electronics expenditure remain similar.


10.29007/x9c9 ◽  
2018 ◽  
Author(s):  
Nik Sultana ◽  
Christoph Benzmüller

The LEO and LEO-II provers have pioneered the integration of higher-order and first-order automated theorem proving. To date, the LEO-II system is, to our knowledge, the only automated higher-order theorem prover which is capable of generating joint higher-order–first-order proof objects in TPTP format. This paper discusses LEO-II’s proof objects. The target audience are practitioners with an interest in using LEO-II proofs within other systems.


2019 ◽  
Vol 26 (4) ◽  
pp. 415-430
Author(s):  
Francesco Bagnardi ◽  
Valentina Petrović

In this article we examine the episode of labour discontent that occurred at the Fiat-Chrysler assembly plant in Kragujevac, Serbia, in the summer of 2017. The article traces the process through which the two main trade unions organised and channelled labour unrest at the plant level. Drawing on Offe and Wiesenthal’s conceptualisation of workers’ collective action dilemma, the case highlights the trade-off between on the one hand the need for institutional legitimation and on the other hand responsiveness to workers’ demands. We attempt to show that unions still have space in which to represent workers’ interests effectively when disputes emerge, regardless of unfavourable structural constraints and legacies. The article shows that not even traditionally non-conflictual and legacy unions can be fully sheltered from democratic pressures from workers and competitor organisations. Therefore, the ability to mediate between democratic and bureaucratic logics of action and legitimation remains crucial for any union and determines unions’ ability to represent effectively the interests of labour. Dans cet article, les auteurs examinent l’épisode de mécontentement des travailleurs qui s’est produit à l’usine d’assemblage Fiat-Chrysler à Kragujevac, en Serbie, à l’été 2017. L’article retrace le processus par lequel les deux principaux syndicats ont organisé et canalisé les conflits de travail au niveau de l’usine. En se fondant sur la conceptualisation développée par Offe et Wiesenthal du choix de l’action collective des travailleurs, ce cas met en évidence le compromis entre, d’une part, le besoin de légitimation institutionnelle et, d’autre part, la capacité à répondre aux demandes des travailleurs. Les auteurs tentent de montrer que les syndicats disposent encore de l’espace nécessaire pour représenter efficacement les intérêts des travailleurs lorsque des conflits surgissent, indépendamment des contraintes structurelles et de l’héritage défavorables qui leur ont été laissés. Cet article montre que même les syndicats traditionnellement non conflictuels et ceux issus du passé ne peuvent pas être totalement à l’abri des pressions démocratiques des travailleurs et des organisations concurrentes. Par conséquent, la capacité de médiation entre les logiques démocratiques et bureaucratiques de l’action et de la légitimation demeure primordiale pour tout syndicat et détermine la capacité des syndicats à représenter efficacement les intérêts des travailleurs. Im vorliegenden Artikel untersuchen wir die Auseinandersetzungen zwischen der Belegschaft und der Unternehmensleitung im Fiat-Chrysler-Montagewerk in Kragujevac, Serbien im Sommer 2017. Der Artikel zeichnet nach, wie die beiden großen betrieblich vertretenen Gewerkschaften die Unzufriedenheit der Arbeitnehmer auf der Werksebene kanalisiert und organisiert haben. Unter Bezugnahme auf Offes und Wiesenthals Konzeptualisierung des Dilemmas des kollektiven Handelns von Arbeitnehmern ist dieser Fall symptomatisch für den Zielkonflikt zwischen der Notwendigkeit institutioneller Legitimation einerseits und dem Reaktionsvermögen auf Forderungen von Arbeitnehmern andererseits. Wir versuchen nachzuweisen, dass Gewerkschaften nach wie vor Handlungsspielräume haben, um in Konfliktfällen Arbeitnehmerinteressen ungeachtet struktureller Einschränkungen und Altlasten effektiv zu vertreten. Der Artikel zeigt, dass nicht einmal traditionell konsensorientierte Gewerkschaften und Rechtsnachfolger der früheren sozialistischen Gewerkschaften umfassend vor demokratisch legitimiertem Druck von Arbeitnehmern und Mitbewerberorganisationen geschützt werden können. Die Fähigkeit, zwischen demokratischer und bürokratischer Handlungslogik und Legitimation vermitteln zu können, ist deshalb für alle Gewerkschaften von entscheidender Bedeutung und bestimmt ihre Fähigkeit, die Interessen von Arbeitnehmern wirksam zu vertreten.


Author(s):  
ANDREAS WOLF ◽  
REINHOLD LETZ

Automated theorem provers use search strategies. Unfortunately, there is no unique strategy which is uniformly successful on all problems. This motivates us to apply different strategies in parallel, in a competitive manner. In this paper, we discuss properties, problems, and perspectives of strategy parallelism in theorem proving. We develop basic concepts like the complementarity and the overlap value of strategy sets. Some of the problems such as initial strategy selection and run-time strategy exchange are discussed in more detail. The paper also contains the description of an implementation of a strategy parallel theorem prover (p-SETHEO) and an experimental evaluation.


2021 ◽  
pp. 1-11
Author(s):  
Quan Du ◽  
Kai Feng ◽  
Chen Xu ◽  
Tong Xiao ◽  
Jingbo Zhu

Recently, many efforts have been devoted to speeding up neural machine translation models. Among them, the non-autoregressive translation (NAT) model is promising because it removes the sequential dependence on the previously generated tokens and parallelizes the generation process of the entire sequence. On the other hand, the autoregressive translation (AT) model in general achieves a higher translation accuracy than the NAT counterpart. Therefore, a natural idea is to fuse the AT and NAT models to seek a trade-off between inference speed and translation quality. This paper proposes an ARF-NAT model (NAT with auxiliary representation fusion) to introduce the merit of a shallow AT model to an NAT model. Three functions are designed to fuse the auxiliary representation into the decoder of the NAT model. Experimental results show that ARF-NAT outperforms the NAT baseline by 5.26 BLEU scores on the WMT’14 German-English task with a significant speedup (7.58 times) over several strong AT baselines.


The DTNS system and RTGS system have their own advantages and drawbacks. The RTGS system is superior in reducing settlement risk. On the other hand, the DTNS system has an advantage on the level of liquidity required for settlement. This means that there is a trade-off between the two systems in terms of risk and efficiency. With knowledge of the pros and cons of the two systems, the most appropriate system should be adopted according to the feature of payments which are processed in the system.


10.29007/jj86 ◽  
2018 ◽  
Author(s):  
Djihed Afifi ◽  
David Rydeheard ◽  
Howard Barringer

We present a novel application of automated theorem proving for the simulation of computational systems. The computational systems we consider are evolvable, i.e. may reconfigure their structure and programs at run-time. In [1], a logical framework for describing such systems is introduced. The underlying logic of this framework allows us to build a simulation engine for executing system specifications. This engine makes intensive use of automated theorem proving – when running a simulation, almost all computational steps are those of a theorem prover. In this paper, we present this novel combination of a logical setting involving meta-level logics and large sets of formulae for system description, together with theorem proving requirements which involve often slowly changing specifications with the need for rapid assessment of deducibility and consistency. We will evaluate the suitability of several theorem provers for this application.


2001 ◽  
Vol 10 (01n02) ◽  
pp. 181-198
Author(s):  
ORTRUN IBENS ◽  
MARC FUCHS

Automated theorem proving with connection tableau calculi imposes search problems in tremendous search spaces. In this paper, we present a new approach to search space reduction in connection tableau calculi. In our approach structurally similar parts of the search space are compressed by means of disjunctive constraints. We describe the necessary changes of the calculus, and we develop elaborate techniques for an efficient constraint processing. Moreover, we present an experimental evaluation of our approach.


2008 ◽  
Vol 8 (5-6) ◽  
pp. 611-641 ◽  
Author(s):  
ARJEN HOMMERSOM ◽  
PETER J. F. LUCAS ◽  
PATRICK VAN BOMMEL

AbstractRequirements about the quality of clinical guidelines can be represented by schemata borrowed from the theory of abductive diagnosis, using temporal logic to model the time-oriented aspects expressed in a guideline. Previously, we have shown that these requirements can be verified using interactive theorem proving techniques. In this paper, we investigate how this approach can be mapped to the facilities of a resolution-based theorem prover,otterand a complementary program that searches for finite models of first-order statements,mace-2. It is shown that the reasoning required for checking the quality of a guideline can be mapped to such a fully automated theorem-proving facilities. The medical quality of an actual guideline concerning diabetes mellitus 2 is investigated in this way.


2014 ◽  
Vol 26 (1) ◽  
pp. 129-153 ◽  
Author(s):  
KARIM KANSO ◽  
ANTON SETZER

In this paper, aimed at dependently typed programmers, we present a novel connection between automated and interactive theorem proving paradigms. The novelty is that the connection offers a better trade-off between usability, efficiency and soundness when compared to existing techniques. This technique allows for a powerful interactive proof framework that facilitates efficient verification of finite domain theorems and guided construction of the proof of infinite domain theorems. Such situations typically occur with industrial verification. As a case study, an embedding of SAT and CTL model checking is presented, both of which have been implemented for the dependently typed proof assistant Agda.Finally, an example of a real world railway control system is presented, and shown using our proof framework to be safe with respect to an abstract model of trains not colliding or derailing. We demonstrate how to formulate safety directly and show using interactive theorem proving that signalling principles imply safety. Therefore, a proof by an automated theorem prover that the signalling principles hold for a concrete system implies the overall safety. Therefore, instead of the need for domain experts to validate that the signalling principles imply safety they only need to make sure that the safety is formulated correctly. Therefore, some of the validation is replaced by verification using interactive theorem proving.


Sign in / Sign up

Export Citation Format

Share Document