Generalization ALgorithms and Applications [GALA]

@inproceedings{RISC5707,
author = {N. Amiridze and T. Kutsia},
title = {{Anti-Unification and Natural Language Processing}},
booktitle = {{Fifth Workshop on Natural Language and Computer Science, NLCS’18}},
language = {english},
series = {EasyChair preprints},
number = {203},
pages = {1--12},
isbn_issn = { },
year = {2018},
editor = {A. Asudeh and V. de Paiva and L. Moss},
refereed = {yes},
length = {12},
url = {https://doi.org/10.29007/fkrh}
}

@inproceedings{RISC5713,
author = {Temur Kutsia and Cleo Pau},
title = {{Proximity-Based Generalization}},
booktitle = {{32nd International Workshop on Unification, UNIF 2018}},
language = {english},
pages = { -- },
isbn_issn = { },
year = {2018},
editor = {Mauricio Ayala-Rincon and Philippe Balbiani},
refereed = {yes},
length = {0}
}

@inproceedings{RISC5471,
author = {David M. Cerna and Michael Lettmann},
title = {{Integrating a Global Induction Mechanism into a Sequent Calculus}},
booktitle = {{TABLEAUX 2017}},
language = {english},
abstract = {Most interesting proofs in mathematics contain an inductive argument which requires an extension of the \textbf{LK}-calculus to formalize. The mostcommonly used calculi contain a separate rule or axiom which reduces the important proof theoretic properties of the calculus. In such cases cut-elimination does not result in analytic proofs, i.e.\ every formula occurring in the proof is a subformula of the end sequent. Proof schemata are a generalization of \textbf{LK}-proofs able to simulate induction by linking proofs, indexed by a natural number, together.Using a global cut-elimination method a normal form can be reached which allows a schema of {\em Herbrand Sequents} to be produced, an essential step for proof analysis in the presence ofinduction. However, proof schema have only been studied in a limited context and are currentlydefined for a very particular proof structure based on a slight extension of the \textbf{LK}-calculus. The result is an opaque and complex formalization. In this paper, we introduce a calculus integrating the proof schema formalization and in the process we elucidate properties of proof schemata which can be used to extend the formalism. },
series = {lecture notes in computer science},
pages = {--},
publisher = {Springer},
isbn_issn = {KA},
year = {2017},
month = {September},
editor = {KA},
refereed = {yes},
length = {16},
conferencename = {Tableaux}
}

@inproceedings{RISC5472,
author = {David M. Cerna and Michael Lettmann},
title = {{Towards a Clausal Analysis of Proof Schemata}},
booktitle = {{SYNASC 2017}},
language = {english},
abstract = {Proof schemata are a variant of \LK-proofs able to simulate various induction schemes in first-order logic by adding so called {\em links} to the standard first-order \LK-calculus. Links allow proofs to reference other proofs, and thus give schemata a recursive structure. {\em Gentzen} style cut-elimination methods, which reduce cuts locally, does not work in the presence of links. However, an alternative method, such as cut-elimination by resolution (CERES), which eliminate cuts globally, is able to reduce cuts over the entire recursive structure simultaneously. Unfortunately, analysis of the cut structure of a proof after partial cut-elimination is non-trivial. By extending local methods to proof schemata, we provide such an analysis. },
series = {IEEE Xplore},
pages = {--},
isbn_issn = {KA},
year = {2017},
month = {September},
editor = {KA},
refereed = {yes},
length = {8}
}

@inproceedings{RISC5416,
author = {Besik Dundua and Temur Kutsia and Klaus Reisenberger-Hagmayr},
title = {{An overview of PρLog}},
booktitle = {{ Proceedings of the 19th International Symposium on Practical Aspects of Declarative Languages, PADL 2017}},
language = {english},
series = {Lecture Notes in Computer Science},
volume = {10137},
pages = {34--49},
publisher = {Springer},
isbn_issn = {ISBN 978-3-319-51675-2},
year = {2017},
editor = {Y. Lierler and W. Taha},
refereed = {yes},
length = {16}
}

@inproceedings{RISC5473,
author = {Mauricio Ayala-Rincon and Besik Dundua and Temur Kutsia and Mircea Marin},
title = {{Rewriting Logic from a ρLog Point of View}},
booktitle = {{Proceedings of the 12th Workshop on Logical and Semantic Frameworks with Applications (LSFA 2017) }},
language = {english},
pages = {--},
isbn_issn = { },
year = {2017},
editor = {Sandra Alves and Renata Wasserman},
refereed = {yes},
length = {16}
}

@inproceedings{RISC5336,
author = {Mircea Marin and Temur Kutsia and Besik Dundua},
title = {{A rewrite-based computational model for functional logic programming}},
booktitle = {{Proceedings of the 7th International Symposium on Symbolic Computation in Software Science, SCSS 2016}},
language = {english},
series = {EPiC Series in Computing},
volume = {39},
pages = {95--106},
publisher = {EasyChair},
isbn_issn = {ISSN 2398-7340},
year = {2016},
editor = {James H. Davenport},
refereed = {yes},
length = {12},
url = {http://www.easychair.org/publications/download/A_rewrite-based_computational_model_for_functional_logic_programming}
}

@inproceedings{RISC5415,
author = {B. Dundua and T. Kutsia and K. Reisenberger-Hagmayr},
title = {{PρLog: Combining Logic Programming with Conditional Transformation Systems (Tool Description)}},
booktitle = {{Technical Communications of the 32nd International Conference on Logic Programming, ICLP 2016}},
language = {english},
series = {OpenAccess Series in Informatics (OASIcs)},
volume = {52},
pages = {10.1--10.5},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
isbn_issn = {ISBN 978-3-95977-007-1, ISSN 2190-6807},
year = {2016},
editor = {M. Carro and A. King and N. Saeedloei and and M. De Vos},
refereed = {yes},
length = {5},
url = {http://drops.dagstuhl.de/opus/volltexte/2016/6740/pdf/OASIcs-ICLP-2016-10.pdf}
}

@inproceedings{RISC5281,
author = {Boris Konev and Temur Kutsia},
title = {{Anti-Unification of Concepts in Description Logic EL}},
booktitle = {{Proceedings of the 15th International Conference on Principles of Knowledge Representation and Reasoning, KR 2016}},
language = {english},
pages = {227--236},
publisher = {AAAI Press},
address = {Cape Town, South Africa},
isbn_issn = {978-1-57735-755-1},
year = {2016},
month = {April 25--29},
editor = {Chitta Baral and James P. Delgrande and Frank Wolter},
refereed = {yes},
length = {10},
url = {http://www.aaai.org/ocs/index.php/KR/KR16/paper/download/12880/12479}
}