Dependency Interconversion

Autor: Eskelund, Norveig Åshild Anderssen

Publikováno v: Eskelund, Norveig Åshild Anderssen. Dependency Interconversion. Master thesis, University of Oslo, 2014

Externí odkaz: http://hdl.handle.net/10852/41537
https://www.duo.uio.no/bitstream/handle/10852/41537/1/eskelund_master.pdf

Skákající jazykové modely

Autor: Ošmera, Lubomír

The main goal of this master thesis is introduction and investigation of extended version of jumping automata and grammars. New versions are primarily focused on bioinformatic applications - DNA computing. This thesis examine their power and other pr

Externí odkaz: http://www.nusl.cz/ntk/nusl-403132

Category theoretic semantics for theorem proving in logic programming: embracing the laxness

Autor: Komendantskaya, Ekaterina, Power, John

Publikováno v: Komendantskaya, E & Power, J 2016, Category theoretic semantics for theorem proving in logic programming: embracing the laxness . in I Hasuo (ed.), Proceedings of Coalgebraic Methods in Computer Science : 13th IFIP WG 1.3 International Workshop, CMCS 2016, Colocated with ETAPS 2016, Eindhoven, The Netherlands, April 2-3, 2016, Revised Selected Papers . Lecture Notes in Computer Science, Springer, pp. 94-113 . https://doi.org/10.1007/978-3-319-40370-0_7

A propositional logic program P may be identified with aP f P f -coalgebra on the set of atomic propositions in the program. Thecorresponding C(P f P f )-coalgebra, where C(P f P f ) is the cofree comonadon P f P f , describes derivations by resoluti

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______1378::c58280f348a12e79774f5c1397e1af81
https://purehost.bath.ac.uk/ws/files/143784570/finalaccepted.pdf

Monadic Second-Order Logic and Transitive Closure Logics over Trees

Autor: Stephan Kepser, Hans Joerg Tiede

Publikováno v: Electronic Notes in Theoretical Computer Science. 165:189-199

Model theoretic syntax is concerned with studying the descriptive complexity of grammar formalisms for natural languages by defining their derivation trees in suitable logical formalisms. The central tool for model theoretic syntax has been monadic s

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::96e6b858c9a08655bdcc56c63b8c1178

Safe Specification of Operator Precedence Rules

Autor: Afroozeh, A., Brand, van den, M.G.J., Johnstone, A., Scott, E., Vinju, J.J., Erwig, M., Paige, R.F., Van Wyk, E.

Publikováno v: Software Language Engineering ISBN: 9783319026534
SLE
SLE 2013-6th International Conference on Software Language Engineering
SLE 2013-6th International Conference on Software Language Engineering, 2013, Indianapolis, United States. ⟨10.1007/978-3-319-02654-1_8⟩
Software Language Engineering (6th International Conference, SLE 2013, Indianapolis, IN, USA, October 26-28, 2013. Proceedings), 137-156
STARTPAGE=137;ENDPAGE=156;TITLE=Software Language Engineering (6th International Conference, SLE 2013, Indianapolis, IN, USA, October 26-28, 2013. Proceedings)

International audience; In this paper we present an approach to specifying opera- tor precedence based on declarative disambiguation constructs and an implementation mechanism based on grammar rewriting. We identify a problem with existing generalize

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ab1e76f504cf81105723b55f045e1011
https://ir.cwi.nl/pub/21831