Search the dblp DataBase
Jan Maluszynski :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Jan Maluszynski , Henryk Jan Komorowski Unification-Free Execution of Logic Programs. [Citation Graph (1, 0)][DBLP ] SLP, 1985, pp:78-86 [Conf ] Jan Maluszynski Towards a Programming Language Based on the Notion of Two-Level Grammar. [Citation Graph (1, 0)][DBLP ] Theor. Comput. Sci., 1984, v:28, n:, pp:13-43 [Journal ] Johan Boye , Wlodzimierz Drabent , Jan Maluszynski Declarative Diagnosis of Contraint Programs: An Assertion-Based Approach. [Citation Graph (0, 0)][DBLP ] AADEBUG, 1997, pp:123-140 [Conf ] Francisco Bueno , Pierre Deransart , Wlodzimierz Drabent , Gérard Ferrand , Manuel V. Hermenegildo , Jan Maluszynski , Germán Puebla On the Role of Semantic Approximations on Validation and Diagnosis of Contraint Logic Programs. [Citation Graph (0, 0)][DBLP ] AADEBUG, 1997, pp:155-169 [Conf ] Gyöngyi Szilágyi , Tibor Gyimóthy , Jan Maluszynski Slicing of Constraint Logic Programs. [Citation Graph (0, 0)][DBLP ] AADEBUG, 2000, pp:- [Conf ] Krzysztof Kuchcinski , Wlodzimierz Drabent , Jan Maluszynski Automatic Diagnosis of VLSI Digital Circuits Using Algorithmic Debugging. [Citation Graph (0, 0)][DBLP ] AADEBUG, 1993, pp:350-367 [Conf ] Jan Maluszynski Reduction goals in bottom-up recognition. [Citation Graph (0, 0)][DBLP ] Automatentheorie und Formale Sprachen, 1973, pp:294-300 [Conf ] Pierre Deransart , Manuel V. Hermenegildo , Jan Maluszynski Introduction. [Citation Graph (0, 0)][DBLP ] Analysis and Visualization Tools for Constraint Programming, 2000, pp:1-20 [Conf ] Wlodzimierz Drabent , Jan Maluszynski , Pawel Pietrzak Locating Type Errors in Untyped CLP Programs. [Citation Graph (0, 0)][DBLP ] Analysis and Visualization Tools for Constraint Programming, 2000, pp:121-150 [Conf ] Wlodzimierz Drabent , Simin Nadjm-Tehrani , Jan Maluszynski The Use of Assertions in Algorithmic Debugging. [Citation Graph (0, 0)][DBLP ] FGCS, 1988, pp:573-581 [Conf ] Piotr Dembinski , Jan Maluszynski Two Level Grammars: CF-Grammars with Equation Schemes. [Citation Graph (0, 0)][DBLP ] ICALP, 1979, pp:171-187 [Conf ] Staffan Bonnier , Jan Maluszynski Towards a Clean Amalgamation of Logic Programs with External Procedures. [Citation Graph (0, 0)][DBLP ] ICLP/SLP, 1988, pp:311-326 [Conf ] Johan Boye , Jan Maluszynski Two Aspects of Directional Types. [Citation Graph (0, 0)][DBLP ] ICLP, 1995, pp:747-761 [Conf ] Jan Maluszynski , Jørgen Fischer Nilsson A Comparison of the Logic Programming Language Prolog with Two-levels Grammars. [Citation Graph (0, 0)][DBLP ] ICLP, 1982, pp:193-199 [Conf ] Pascal Chambre , Pierre Deransart , Jan Maluszynski Une méthode de preuve pour programmes concurrents avec contraintes sous forme clausale. [Citation Graph (0, 0)][DBLP ] JFPLC, 1996, pp:115-130 [Conf ] Pierre Deransart , Jan Maluszynski Modélisation du flot de données par des schémas d'attributs dans les programmes logiques. [Citation Graph (0, 0)][DBLP ] SPLT, 1984, pp:- [Conf ] Wlodzimierz Drabent , Jan Maluszynski , Pawel Pietrzak Parametric Descriptive Types for CLP. [Citation Graph (0, 0)][DBLP ] JFPLC, 2001, pp:239-256 [Conf ] Wlodzimierz Drabent , Simin Nadjm-Tehrani , Jan Maluszynski Algorithmic Debugging with Assertions. [Citation Graph (0, 0)][DBLP ] META, 1988, pp:501-521 [Conf ] Piotr Dembinski , Jan Maluszynski Attribute Grammars and Two-Level Grammars: A Unifying Approach. [Citation Graph (0, 0)][DBLP ] MFCS, 1978, pp:143-154 [Conf ] Jan Maluszynski Substring Languages. [Citation Graph (0, 0)][DBLP ] MFCS, 1974, pp:274-284 [Conf ] Jan Maluszynski A Contribution to Error Recovery. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:302-307 [Conf ] Jan Maluszynski , Aida Vitória Defining Rough Sets by Extended Logic Programs. [Citation Graph (0, 0)][DBLP ] Paraconsistent Computational Logic, 2002, pp:81-90 [Conf ] Pierre Deransart , Jan Maluszynski A Grammatical View of Logic Programming. [Citation Graph (0, 0)][DBLP ] PLILP, 1988, pp:219-251 [Conf ] Staffan Bonnier , Jan Maluszynski Towards a Clean Amalgamation of Logic Programs with External Procedures. [Citation Graph (0, 0)][DBLP ] PLILP, 1988, pp:20-34 [Conf ] Gary Lindstrom , Jan Maluszynski , Takeshi Ogi Our LIPS Are Sealed: Interfacing Functional and Logic Programming Systems. [Citation Graph (0, 0)][DBLP ] PLILP, 1992, pp:428-442 [Conf ] Uwe Aßmann , Jakob Henriksson , Jan Maluszynski Combining Safe Rules and Ontologies by Interfacing of Reasoners. [Citation Graph (0, 0)][DBLP ] PPSWR, 2006, pp:33-47 [Conf ] François Bry , Wlodzimierz Drabent , Jan Maluszynski On Subtyping of Tree-Structured Data: A Polynomial Approach. [Citation Graph (0, 0)][DBLP ] PPSWR, 2004, pp:1-18 [Conf ] Jakob Henriksson , Jan Maluszynski Static Type-Checking of Datalog with Ontologies. [Citation Graph (0, 0)][DBLP ] PPSWR, 2004, pp:76-89 [Conf ] Aida Vitória , Carlos Viegas Damásio , Jan Maluszynski Toward Rough Knowledge Bases with Quantitative Measures. [Citation Graph (0, 0)][DBLP ] Rough Sets and Current Trends in Computing, 2004, pp:153-158 [Conf ] Aida Vitória , Jan Maluszynski A Logic Programming Framework for Rough Sets. [Citation Graph (0, 0)][DBLP ] Rough Sets and Current Trends in Computing, 2002, pp:205-212 [Conf ] Robin Andersson , Aida Vitória , Jan Maluszynski , Henryk Jan Komorowski RoSy: A Rough Knowledge Base System. [Citation Graph (0, 0)][DBLP ] RSFDGrC (2), 2005, pp:48-58 [Conf ] Aida Vitória , Carlos Viegas Damásio , Jan Maluszynski Query Answering in Rough Knowledge Bases. [Citation Graph (0, 0)][DBLP ] RSFDGrC, 2003, pp:197-204 [Conf ] Jan Maluszynski Attribute Grammars and Logic Programs: A Comparison of Concepts. [Citation Graph (0, 0)][DBLP ] Attribute Grammars, Applications and Systems, 1991, pp:330-357 [Conf ] Johan Boye , Jukka Paakki , Jan Maluszynski Synthesis of Directionality Information for Functional Logic Programs. [Citation Graph (0, 0)][DBLP ] WSA, 1993, pp:165-177 [Conf ] Piotr Dembinski , Jan Maluszynski AND-Parallelism with Intelligent Backtracking for Annotated Logic Programs. [Citation Graph (0, 0)][DBLP ] SLP, 1985, pp:29-38 [Conf ] Jan Maluszynski , Torbjörn Näslund Fail Substitutions for Negation as Failure. [Citation Graph (0, 0)][DBLP ] NACLP, 1989, pp:461-476 [Conf ] Wlodzimierz Drabent , Jan Maluszynski Inductive Assertion Method for Logic Programs. [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.2, 1987, pp:167-181 [Conf ] Gyöngyi Szilágyi , Tibor Gyimóthy , Jan Maluszynski Static and Dynamic Slicing of Constraint Logic Programs. [Citation Graph (0, 0)][DBLP ] Autom. Softw. Eng., 2002, v:9, n:1, pp:41-65 [Journal ] Wlodzimierz Drabent , Jan Maluszynski , Pawel Pietrzak Using parametric set constraints for locating errors in CLP programs [Citation Graph (0, 0)][DBLP ] CoRR, 2002, v:0, n:, pp:- [Journal ] Jan Maluszynski Regular Structures in Programming Languages. [Citation Graph (0, 0)][DBLP ] Elektronische Informationsverarbeitung und Kybernetik, 1975, v:11, n:4-6, pp:290-295 [Journal ] Jan Maluszynski On integrating rules into the Semantic Web. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2003, v:86, n:3, pp:- [Journal ] Aida Vitória , Carlos Viegas Damásio , Jan Maluszynski From Rough Sets to Rough Knowledge Bases. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2003, v:57, n:2-4, pp:215-246 [Journal ] Jacek Leszczylowski , Staffan Bonnier , Jan Maluszynski Logic Programming with External Procedures: Introducing S-Unification. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1988, v:27, n:3, pp:159-165 [Journal ] Jan Maluszynski , Jørgen Fischer Nilsson Grammatical Unification. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1982, v:15, n:4, pp:150-158 [Journal ] Johan Boye , Jan Maluszynski Directional Types and the Annotation Method. [Citation Graph (0, 0)][DBLP ] J. Log. Program., 1997, v:33, n:3, pp:179-220 [Journal ] Pierre Deransart , Jan Maluszynski Relating Logic Programs and Attribute Grammars. [Citation Graph (0, 0)][DBLP ] J. Log. Program., 1985, v:2, n:2, pp:119-155 [Journal ] Henryk Jan Komorowski , Jan Maluszynski Logic Programming and Rapid Prototyping. [Citation Graph (0, 0)][DBLP ] Sci. Comput. Program., 1987, v:9, n:2, pp:179-205 [Journal ] Wlodzimierz Drabent , Jan Maluszynski Inductive Assertion Method for Logic Programs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1988, v:59, n:, pp:133-155 [Journal ] Wlodzimierz Drabent , Jan Maluszynski , Pawel Pietrzak Type-based Diagnosis of CLP Programs. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 1999, v:30, n:4, pp:- [Journal ] Wlodzimierz Drabent , Jan Maluszynski , Pawel Pietrzak Using parametric set constraints for locating errors in CLP programs. [Citation Graph (0, 0)][DBLP ] TPLP, 2002, v:2, n:4-5, pp:549-610 [Journal ] Wlodzimierz Drabent , Jakob Henriksson , Jan Maluszynski Hybrid Reasoning with Rules and Constraints under Well-Founded Semantics. [Citation Graph (0, 0)][DBLP ] RR, 2007, pp:348-357 [Conf ] Wlodzimierz Drabent , Jan Maluszynski Well-Founded Semantics for Hybrid Rules. [Citation Graph (0, 0)][DBLP ] RR, 2007, pp:1-15 [Conf ] Jan Maluszynski , Andrzej Szalas , Aida Vitória A Four-Valued Logic for Rough Set-Like Approximate Reasoning. [Citation Graph (0, 0)][DBLP ] T. Rough Sets, 2007, v:6, n:, pp:176-190 [Journal ] HD-rules: A Hybrid System Interfacing Prolog with DL-reasoners. [Citation Graph (, )][DBLP ] Paraconsistent Logic Programs with Four-Valued Rough Sets. [Citation Graph (, )][DBLP ] Four-Valued Extension of Rough Sets. [Citation Graph (, )][DBLP ] Hybrid Rules with Well-Founded Semantics [Citation Graph (, )][DBLP ] Search in 0.036secs, Finished in 0.037secs