The Experts below are selected from a list of 2892 Experts worldwide ranked by ideXlab platform
Peter Baumgartner - One of the best experts on this subject based on the ideXlab platform.
-
The Hyper Tableaux Calculus with Equality
2008Co-Authors: Peter Baumgartner, Björn Pelzer, Ulrich FurbachAbstract:In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in the hyper tableau calculus. It is based on splitting of positive clauses and an adapted version of the superposition inference Rule, where equations used for paramodulation are drawn (only) from a set of positive unit clauses, the candidate model. The calculus also features a generic, semantically justified Simplification Rule which covers many redundancy elimination techniques known from superposition theorem proving. Our main results are soundness and completeness, but we briefly describe the implementation, too
-
Hyper Tableaux with Equality
Springer-Verlag, 2007Co-Authors: Peter Baumgartner, Ulrich Furbach, Björn PelzerAbstract:In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in the hyper tableau calculus. It is based on splitting of positive clauses and an adapted version of the superposition inference Rule, where equations used for paramodulation are drawn (only) from a set of positive unit clauses, the candidate model. The calculus also features a generic, semantically justified Simplification Rule which covers many redundancy elimination techniques known from superposition-style theorem proving. Our main theoretical result is the soundness and completeness of the calculus. The calculus is implemented, and we also report on practical experiments
-
Programming Logics Group
2005Co-Authors: Peter Baumgartner, Cesare TinelliAbstract:In many theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in the Model Evolution calculus (ME), a first-order version of the propositional DPLL procedure. The new calculus, MEE, is a proper extension of the ME calculus without equality. Like ME it maintains an explicit candidate model, which is searched for by DPLL-style splitting. For equational reasoning MEE uses an adapted version of the ordered paramodulation inference Rule, where equations used for paramodulation are drawn (only) from the candidate model. The calculus also features a generic, semantically justified Simplification Rule which covers many Simplification techniques known from superposition-style theorem proving. Our main result is the correctness of the MEE calculus in the presence of very general redundancy elimination criteria.
Ulrich Furbach - One of the best experts on this subject based on the ideXlab platform.
-
The Hyper Tableaux Calculus with Equality
2008Co-Authors: Peter Baumgartner, Björn Pelzer, Ulrich FurbachAbstract:In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in the hyper tableau calculus. It is based on splitting of positive clauses and an adapted version of the superposition inference Rule, where equations used for paramodulation are drawn (only) from a set of positive unit clauses, the candidate model. The calculus also features a generic, semantically justified Simplification Rule which covers many redundancy elimination techniques known from superposition theorem proving. Our main results are soundness and completeness, but we briefly describe the implementation, too
-
Hyper Tableaux with Equality
Springer-Verlag, 2007Co-Authors: Peter Baumgartner, Ulrich Furbach, Björn PelzerAbstract:In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in the hyper tableau calculus. It is based on splitting of positive clauses and an adapted version of the superposition inference Rule, where equations used for paramodulation are drawn (only) from a set of positive unit clauses, the candidate model. The calculus also features a generic, semantically justified Simplification Rule which covers many redundancy elimination techniques known from superposition-style theorem proving. Our main theoretical result is the soundness and completeness of the calculus. The calculus is implemented, and we also report on practical experiments
Björn Pelzer - One of the best experts on this subject based on the ideXlab platform.
-
The Hyper Tableaux Calculus with Equality
2008Co-Authors: Peter Baumgartner, Björn Pelzer, Ulrich FurbachAbstract:In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in the hyper tableau calculus. It is based on splitting of positive clauses and an adapted version of the superposition inference Rule, where equations used for paramodulation are drawn (only) from a set of positive unit clauses, the candidate model. The calculus also features a generic, semantically justified Simplification Rule which covers many redundancy elimination techniques known from superposition theorem proving. Our main results are soundness and completeness, but we briefly describe the implementation, too
-
Hyper Tableaux with Equality
Springer-Verlag, 2007Co-Authors: Peter Baumgartner, Ulrich Furbach, Björn PelzerAbstract:In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in the hyper tableau calculus. It is based on splitting of positive clauses and an adapted version of the superposition inference Rule, where equations used for paramodulation are drawn (only) from a set of positive unit clauses, the candidate model. The calculus also features a generic, semantically justified Simplification Rule which covers many redundancy elimination techniques known from superposition-style theorem proving. Our main theoretical result is the soundness and completeness of the calculus. The calculus is implemented, and we also report on practical experiments
Mantas Jan - One of the best experts on this subject based on the ideXlab platform.
-
Evaluating Medical Lexical Simplification: Rule-Based vs. BERT
'IOS Press', 2021Co-Authors: Tran Linh, Velazquez Erick, Sips, Robert Jan, De Boer Victor, Mantas JanAbstract:Lexical Simplification (LS) can decrease the communication gap between medical experts and laypeople by replacing medical terms with layperson counterparts. In this paper, we present: 1) a Rule-based approach to LS using a consumer health vocabulary, and 2) an unsupervised approach using BERT to generate word candidates. Human evaluation shows that the unsupervised model performed better for simplicity and grammaticality, while the Rule-based method was better at meaning preservation
P V G Bradbeer - One of the best experts on this subject based on the ideXlab platform.
-
ternary decision diagram optimisation of reed muller logic functions using a genetic algorithm for variable and Simplification Rule ordering
Artificial Intelligence and the Simulation of Behaviour, 1995Co-Authors: Julian F Miller, P Thomson, P V G BradbeerAbstract:This paper details a method for reducing gate counts for logic functions in the Reed-Muller logic system, using a bottom up ternary decision diagram (TDD). The method employed uses a two chromosome genetic algorithm — to vary the ordering of both the function variables, and the TDD Simplification Rules — to achieve potentially substantial gate count savings in large expressions when compared with an earlier version which used a single chromosome representation for the variable ordering only. The results also compare very favourably with one of the best heuristic minimisers in the literature [EXMIN2].