Tomer Libal

Prof. Tomer Libal

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 May 2021
Verified
Report
Open access
DSDave Sayers
Dave Sayers
RSRui Sousa-Silva
Rui Sousa-Silva
SHSviatlana Höhn
Sviatlana Höhn
LALule Ahmedi
Lule Ahmedi
KAKais Allkivi-Metsoja
Kais Allkivi-Metsoja
SULE YILDIRIM-YAYILGANSULE YILDIRIM-YAYILGAN
SULE YILDIRIM-YAYILGAN
New language technologies are coming, thanks to the huge and competing private investment fuelling rapid progress; we can either understand and foresee their effects, or be taken by surprise and spend our time trying to catch up. This report scketches out some transformative new technologies that are likely to fundamentally change our use of language. Some of these may feel unrealistically futuristic or far-fetched, but a central purpose of this report - and the wider LITHME network - is to illustrate that these are mostly just the logical development and maturation of technologies currently in prototype. But will everyone benefit from all these shiny new gadgets? Throughout this report we emphasise a range of groups who will be disadvantaged and issues of inequality. Important issues of security and privacy will accompany new language technologies. A further caution is to re-emphasise the current limitations of AI. Looking ahead, we see many intriguing opportunities and new capabilities, but a range of other uncertainties and inequalities. New devices will enable new ways to talk, to translate, to remember, and to learn. But advances in technology will reproduce existing inequalities among those who cannot afford these devices, among the world’s smaller languages, and especially for sign language. Debates over privacy and security will flare and crackle with every new immersive gadget. We will move together into this curious new world with a mix of excitement and apprehension - reacting, debating, sharing and disagreeing as we always do. Plug in, as the human-machine era dawns.

30 September 2021 in Annals of Mathematics and Artificial Intelligence
Verified
Journal Article
Open access
PDF file
TLTomer Libal
Tomer Libal
DMDale Miller
Dale Miller
Unification is a central operation in constructing a range of computational logic systems based on first-order and higher-order logics. First-order unification has several properties that guide its incorporation in such systems. In particular, first-order unification is decidable, unary, and can be performed on untyped term structures. None of these three properties hold for full higher-order unification: unification is undecidable, unifiers can be incomparable, and term-level typing can dominate the search for unifiers. The so-calledpatternsubset of higher-order unification was designed to be a small extension to first-order unification that respects the laws governingλ-binding (i.e., the equalities forα,β, andη-conversion) but which also satisfied those three properties. While the pattern fragment of higher-order unification has been used in numerous implemented systems and in various theoretical settings, it is too weak for many applications. This paper defines an extension of pattern unification that should make it more generally applicable, especially in proof assistants that allow for higher-order functions. This extension’s main idea is that the arguments to a higher-order, free variable can be more than just distinct bound variables. In particular, such arguments can be terms constructed from (sufficient numbers of) such bound variables using term constructors and where no argument is a subterm of any other argument. We show that this extension to pattern unification satisfies the three properties mentioned above.

23 September 2022
Verified
Book Chapter
Closed access
PDF file
TNTereza Novotná
Tereza Novotná
TLTomer Libal
Tomer Libal

27 April 2023 in Frontiers in Artificial Intelligence
Verified
Journal Article
Open access
TLTomer Libal
Tomer Libal
There is an inherent tension between knowledge representation and reasoning. For an optimal representation and validation, an expressive language should be used. For an optimal automated reasoning, a simple one is preferred. Which language should we choose for our legal knowledge representation if our goal is to apply automated legal reasoning? In this paper, we investigate the properties and requirements of each of these two applications. We suggest that by using Legal Linguistic Templates, one can solve the above tension in some practical situations.

13 April 2021
Verified
Book Chapter
Closed access
PDF file
TLTomer Libal
Tomer Libal