The Experts below are selected from a list of 20154 Experts worldwide ranked by ideXlab platform
Schulz Stephan - One of the best experts on this subject based on the ideXlab platform.
-
Extending a Brainiac Prover to Lambda-Free Higher-Order Logic
HAL CCSD, 2019Co-Authors: Vukmirović Petar, Blanchette, Jasmin Christian, Cruanes Simon, Schulz StephanAbstract:International audienceDecades of work have gone into developing efficient proof calculi, data structures, algorithms, and heuristics for first-order automatic theorem proving. Higher-order provers lag behind in terms of efficiency. Instead of developing a new higher-order prover from the ground up, we propose to start with the state-of-the-art superposition-based prover E and gradually enrich it with higher-order features. We explain how to extend the prover's data structures, algorithms, and heuristics to λ-free higher-order logic, a formalism that supports partial application and applied variables. Our extension outperforms the traditional encoding and appears promising as a stepping stone towards full higher-order logic
Stephan Schulz - One of the best experts on this subject based on the ideXlab platform.
-
Extending a Brainiac Prover to Lambda-Free Higher-Order Logic
2019Co-Authors: Petar Vukmirović, Simon Cruanes, Jasmin Christian Blanchette, Stephan SchulzAbstract:Decades of work have gone into developing efficient proof calculi, data structures, algorithms, and heuristics for first-order automatic theorem proving. Higher-order provers lag behind in terms of efficiency. Instead of developing a new higher-order prover from the ground up, we propose to start with the state-of-the-art superposition-based prover E and gradually enrich it with higher-order features. We explain how to extend the prover's data structures, algorithms, and heuristics to λ-free higher-order logic, a formalism that supports partial application and applied variables. Our extension outperforms the traditional encoding and appears promising as a stepping stone towards full higher-order logic.
Barta Péter - One of the best experts on this subject based on the ideXlab platform.
-
Polysémie, homonymie et homophonie dans les proverbes détournés — avec des exemples Français, Hongrois, Anglais, Allemands et Russes
'Akademiai Kiado Zrt.', 2029Co-Authors: Barta Péter, Hrisztova-gotthardt Hrisztalina, Litovkina, Anna T., Vargha KatalinAbstract:On the basis of French, Hungarian, English, German and Russian corpora of anti-Proverbs (deliberate proverb innovations, also known as alterations, mutations, parodies, transformations, variations, wisecracks, and fractured Proverbs), we examine word play based on polysemy, homonymy, and homophony. After a survey of the Proverbs most frequently used for these types of alteration, this study investigates anti-Proverbs linked to the theme of sexuality. Finally, we explore the use of proper nouns in proverb transformations based on polysemy, homonymy, and homophony
-
Paronomasie oder wie ein Sprichwort zum Antisprichwort wird
'Akademiai Kiado Zrt.', 2029Co-Authors: Hrisztova-gotthardt Hrisztalina, Barta Péter, Litovkina, Anna T., Vargha KatalinAbstract:Paronomasia is a popular form of wordplay often used to transform Proverbs into antiProverbs (deliberate proverb innovations, also known as alterations, mutations, parodies, transformations, variations, wisecracks, and fractured Proverbs) by replacing certain phonemes with similar ones, or by adding or omitting phonemes. The present paper describes and exemplifies this sort of pun by using selected German, Hungarian, English, French and Russian language data. The first part of the paper focuses on the linguistic aspects of paronomasia; the second part stresses semantic characteristics. This study also examines the role of wordplay on the theme of sexuality, and then comments on the use of proper nouns in proverb transformations. We conclude that all five of the languages in our research corpus use similar, if not identical, approaches to forge a “twisted wisdom” out of a simple proverb
-
Quelques Caractéristiques des Proverbes-Valises du Français
'Akademiai Kiado Zrt.', 2027Co-Authors: Barta PéterAbstract:This study deals with a field that has not yet been much explored: mixed (contaminated) French Proverbs, i. e., anti-Proverbs containing more than one phraseological unit (of which at least one must be a proverb or a proverb pattern). Using a corpus of 70 French compound Proverbs, the analysis has been done on the basis of the number of original phraseological units in the compound (up to 7) the nature of the phraseological units contained in the compound proverb (proverb, proverbial expression, proverb pattern) the linkage between the units (are they isolated from, or embedded in, each other?) the familiarity of the original units used for the mixing topics (sexuality, women, drinking) stylistic labels (colloquial, vulgar) the integrity of the units to be found in the compound proverb (Is the first/second part of the first/second unit present in the compound? If it is, does it appear in an unmodified or a modified form?) the distribution of original units and parts of units to make up a compound compound patterns common points in original units twins (compounds made up of the same original units
-
La Nourriture et la Boisson Dans Les Proverbes Détournés du Français
'Akademiai Kiado Zrt.', 2027Co-Authors: Barta PéterAbstract:To fill a gap in paremiology, this study, based on a 100-item corpus, deals with French anti-Proverbs about food and drink (both being important subjects in France). The paper begins with a discussion of the difficulties involved in distinguishing proverb variants from anti-Proverbs and then proceeds to describe those characteristics shared by the Proverbs and anti-Proverbs on these subjects: there are twice as many expressions about food as about drink and five times as many about alcohol as about soft drinks; furthermore, Proverbs and anti-Proverbs possess a similar distribution of usage labels and similar pairs of antonymic utterances. But there are notable ways in which the Proverbs differ from the anti-Proverbs: while Proverbs tend to discourage excess, anti-Proverbs celebrate it; and while Proverbs focus on wine, anti-Proverbs mention mainly beer.Anti-Proverbs about food and drink are a characteristic part of the French anti-proverbial stock, sharing several peculiarities with the genre as a whole (e.g., including the proportion of compound Proverbs in both corpuses, as well as the proportion of items that are most frequently used)
Vukmirović Petar - One of the best experts on this subject based on the ideXlab platform.
-
Extending a Brainiac Prover to Lambda-Free Higher-Order Logic
HAL CCSD, 2019Co-Authors: Vukmirović Petar, Blanchette, Jasmin Christian, Cruanes Simon, Schulz StephanAbstract:International audienceDecades of work have gone into developing efficient proof calculi, data structures, algorithms, and heuristics for first-order automatic theorem proving. Higher-order provers lag behind in terms of efficiency. Instead of developing a new higher-order prover from the ground up, we propose to start with the state-of-the-art superposition-based prover E and gradually enrich it with higher-order features. We explain how to extend the prover's data structures, algorithms, and heuristics to λ-free higher-order logic, a formalism that supports partial application and applied variables. Our extension outperforms the traditional encoding and appears promising as a stepping stone towards full higher-order logic
Petar Vukmirović - One of the best experts on this subject based on the ideXlab platform.
-
Extending a Brainiac Prover to Lambda-Free Higher-Order Logic
2019Co-Authors: Petar Vukmirović, Simon Cruanes, Jasmin Christian Blanchette, Stephan SchulzAbstract:Decades of work have gone into developing efficient proof calculi, data structures, algorithms, and heuristics for first-order automatic theorem proving. Higher-order provers lag behind in terms of efficiency. Instead of developing a new higher-order prover from the ground up, we propose to start with the state-of-the-art superposition-based prover E and gradually enrich it with higher-order features. We explain how to extend the prover's data structures, algorithms, and heuristics to λ-free higher-order logic, a formalism that supports partial application and applied variables. Our extension outperforms the traditional encoding and appears promising as a stepping stone towards full higher-order logic.
