Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Stuber, Jürgen."'
Autor:
Schmidt-Schauβ, Manfred1 schauss@ki.informatik.uni-frankfurt.de, Stuber, Jürgen2 stuber@loria.fr
Publikováno v:
Theory of Computing Systems. Nov/Dec2004, Vol. 37 Issue 6, p717-740. 24p.
Autor:
Prätzler, Robert C.1, Stuber, Jürgen
Publikováno v:
Umsatzsteuer-Rundschau. Sep2017, Vol. 66 Issue 18, p710-714. 2p.
Autor:
Stuber, Jürgen, Van Den Brand, Mark
Publikováno v:
Workshop on Principles and Practice of Semantic Web Reasoning-PPSWR'2003
Workshop on Principles and Practice of Semantic Web Reasoning-PPSWR'2003, Dec 2003, Mumbai, India, 15 p
Workshop on Principles and Practice of Semantic Web Reasoning-PPSWR'2003, Dec 2003, Mumbai, India, 15 p
Colloque avec actes et comité de lecture. internationale.; International audience; We report on a project to use SGLR parsing and term rewriting with ELAN4 to extract the semantics of mathematical formulas from a {\LaTeX} document and representing t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::1cf1564cd592b65456e69b983e63835e
https://hal.inria.fr/inria-00099469
https://hal.inria.fr/inria-00099469
Autor:
Ganzinger, Harald, Stuber, Jürgen
Publikováno v:
[Research Report] RR-4835, INRIA. 2003, pp.23
This report describes a superposition calculus where quantifiers are eliminated lazily. Superposition and simplification inferences may employ equivalences that have arbitrary formulas at their smaller side. A closely related calculus is implemented
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::d2161b95d78c53e071f19fd66ce1e472
https://hal.inria.fr/inria-00071750/document
https://hal.inria.fr/inria-00071750/document
Publikováno v:
2nd International Workshop on Complexity in Automated Deduction-CiAD'02
2nd International Workshop on Complexity in Automated Deduction-CiAD'02, Jul 2002, Copenhagen, Denmark. 18 p
[Research Report] RR-4923, INRIA. 2003, pp.28
2nd International Workshop on Complexity in Automated Deduction-CiAD'02, Jul 2002, Copenhagen, Denmark. 18 p
[Research Report] RR-4923, INRIA. 2003, pp.28
Colloque avec actes sans comité de lecture. internationale.; International audience; We investigate the complexity landscape of context matching with respect to the number of occurrences of variables (i.e. linearity vs. varity 2) and various restric
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::086ff9f2f0b3305c527e6633f4d5d1fd
https://hal.inria.fr/inria-00100988
https://hal.inria.fr/inria-00100988
Publikováno v:
[Intern report] A01-R-386 || kirchner01c, 2001, 50 p
Rapport interne.; XSLT is a rule-based language defined by the W3C for the transformation of XML-documents into XML-documents. XML-documents are essentially labelled rooted ordered trees or equivalently terms without arity restrictions. This motivate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2d4b19ba4ef5aa273126e6018d3ffb4a
https://inria.hal.science/inria-00107547/file/A01-R-386.pdf
https://inria.hal.science/inria-00107547/file/A01-R-386.pdf
Autor:
Bachmair, Leo, Stuber, Jürgen
Publikováno v:
Rewriting Techniques & Applications (9783540677789); 2000, p229-245, 17p