Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Maluszynski, Jan"'
Autor:
Maluszynski, Jan, Szalas, Andrzej
The paper discusses properties of a DATALOG$^{\neg\neg}$-like query language 4QL, originally outlined in [MS10]. Negated literals in heads of rules naturally lead to inconsistencies. On the other hand, rules do not have to attach meaning to some lite
Externí odkaz:
http://arxiv.org/abs/1011.5105
Autor:
Małuszyński, Jan, Vitória, Aida
We show how definite extended logic programs can be used for defining and reasoning with rough sets. Moreover, a rough-set-specific query language is presented and an answering algorithm is outlined. Thus, we not only show a possible application of a
Externí odkaz:
http://arxiv.org/abs/cs/0207089
Slicing is a program analysis technique originally developed for imperative languages. It facilitates understanding of data flow and debugging. This paper discusses slicing of Constraint Logic Programs. Constraint Logic Programming (CLP) is an emergi
Externí odkaz:
http://arxiv.org/abs/cs/0012014
Autor:
Maluszyński, Jan
Publikováno v:
In Electronic Notes in Theoretical Computer Science November 2003 86(3):1-11
Publikováno v:
In Electronic Notes in Theoretical Computer Science April 2000 30(4):215-234
Autor:
Cristina Baroglio, Polleres Axel, Schaffert Sebastian, Marchiori Massimo, Maluszynski Jan, Piero A. Bonatti
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540856566
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a0254e0e7630e476e2bdb68fb37e43da
https://doi.org/10.1007/978-3-540-85658-0
https://doi.org/10.1007/978-3-540-85658-0
Autor:
Cirstea, Horatiu, Coquery, Emmanuel, Drabent, Wlodzimierz, Fages, Francois, Kirchner, Claude, Maluszynski, Jan, Wack, Benjamin
Publikováno v:
[Contract] A04-R-560 || cirstea04e, Inria. 2004, 33 p
Rapport de contrat.; We survey and analyse the relevant existing work on typing of rules, in particular on typing of constraint logic programs and discuss applicability of these approaches to the rewerse reasoning and query languages under developmen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c77dc26b8ac9644cea1a49ac730a35d6
https://inria.hal.science/inria-00099859/file/A04-R-560.pdf
https://inria.hal.science/inria-00099859/file/A04-R-560.pdf
Slicing is a program analysis technique originally developed for imperative languages. This paper discusses slicing of CLP programs. As data flow in such programs is not explicit, the slicing problem requires a specific formulation and specific techn
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______261::26de57723a86deb7da733c03ea4adad6
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-190398
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-190398
Autor:
Bueno Carrillo, Francisco, Deransart, Pierre, Drabent, Wlodek, Ferrand, Gerard, Hermenegildo, Manuel V., Maluszynski, Jan, Puebla Sánchez, Alvaro Germán
Publikováno v:
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming | Third International Workshop on Automatic Debugging | May 26-27, 1997 | Linköping, Sweden
Archivo Digital UPM
instname
Archivo Digital UPM
instname
is not available.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a13424f7b9b1d91bd75605350b931c73
http://oa.upm.es/14557/
http://oa.upm.es/14557/
Autor:
Boye, Johan, Maluszynski, Jan
Publikováno v:
[Research Report] RR-2471, INRIA. 1995
Projet CHLOE; A {\em directional type\/} for a Prolog program expresses certain properties of the operational semantics of the program. This paper shows that the annotation proof method, proposed by Deransart for proving declarative properties of log
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::78a226ad55dbf0d3238f86d9da005d8e
https://hal.inria.fr/inria-00074204/file/RR-2471.pdf
https://hal.inria.fr/inria-00074204/file/RR-2471.pdf