Linh Anh Nguyen's Papers

Linh Anh Nguyen's Papers

Automated Reasoning in Modal and Description Logics (Using Tableau Methods)

ExpTime Tableaux with Global Caching for Graded Propositional Dynamic Logic, L.A. Nguyen. Manuscript, 2015.
ExpTime Tableaux with Global Caching for the Description Logic SHOQ, L.A. Nguyen and J. Golińska-Pilarek. Fundam. Inform. 135(4): 433-449, 2014. (a long version)
ExpTime Tableaux for the Description Logic SHIQ Based on Global State Caching and Integer Linear Feasibility Checking, L.A. Nguyen. Manuscript arXiv:1205.5838, 2012.
A Cut-Free ExpTime Tableau Decision Procedure for the Logic Extending Converse-PDL with Regular Inclusion Axioms, L.A. Nguyen. Manuscript arXiv:1104.0405, 2011.
ExpTime Tableaux for ALC Using Sound Global Caching, R. Goré and L.A. Nguyen. J. Autom. Reasoning 50(4): 355-381 (2013).
A Cut-Free ExpTime Tableau Decision Procedure for the Description Logic SHI, L.A. Nguyen. In Proceedings of ICCCI'2011, LNAI 6922, pages 572-581, Springer, 2011.
long version, bibtex, talk-slides.
Cut-Free ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic ALCI, L.A. Nguyen. In Proceedings of ISMIS'2011, LNAI 6804, pages 465-475, Springer, 2011.
long version, bibtex, talk-slides.
ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse, L.A. Nguyen and A. Szałas. Studia Logica, 98(3), 2011, 387-428.
pdf, bibtex.
Tableaux with Global Caching for Checking Satisfiability of a Knowledge Base in the Description Logic SH, L.A. Nguyen and A. Szałas. Transactions on Computational Collective Intelligence 1, LNCS 6220, pages 21-38, 2010.
pdf, bibtex.
Checking Consistency of an ABox w.r.t. Global Assumptions in PDL, L.A. Nguyen and A. Szałas. Fundamenta Informaticae, 102(1), 2010, 97-113.
pdf, bibtex, talk-slides.
Optimal Tableau Decision Procedures for PDL, Linh Anh Nguyen and Andrzej Szałas. Manuscript arXiv:0904.0721v2, 2009.
An Optimal Tableau Decision Procedure for Converse-PDL, L.A. Nguyen and A. Szałas. In N.-T. Nguyen et al. (Eds), Proceedings of KSE'2009, pages 207-214, IEEE Computer Society, 2009.
pdf, long version, bibtex, talk-slides.
ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic ALC, L.A. Nguyen and A. Szałas. In N.-T. Nguyen et al. (Eds), Proceedings of ICCCI'2009, LNCS 5796, pages 473-488, Springer, 2009.
pdf, bibtex.
A Tableau Calculus for Regular Grammar Logics with Converse, L.A. Nguyen and A. Szałas. In R.A. Schmidt (Ed.), Proceedings of CADE-22, LNAI 5663, pages 421-436, Springer, 2009.
long version, bibtex, talk-slides.
Clausal Tableaux for Multimodal Logics of Belief, R. Goré and L.A. Nguyen. Fundamenta Informaticae, 94(1), 2009, 21-40.
pdf, bibtex.
An Efficient Tableau Prover using Global Caching for the Description Logic ALC, L.A. Nguyen. Fundamenta Informaticae, 93(1-3), 2009, 273-288.
pdf, bibtex, talk-slides.
Sound Global Caching for Abstract Modal Tableaux, R. Goré and L.A. Nguyen. In Hans-Dieter Burkhard et al. (Eds.), Proceedings of CS&P'2008, pages 157-167.
pdf, bibtex, talk-slides.
Analytic Cut-free Tableaux for Regular Modal Logics of Agent Beliefs, R. Goré and L.A. Nguyen. In F. Sadri and K. Satoh (Eds.), Proceedings of CLIMA-VIII, LNAI 5056, pages 268-287, Springer, 2008.
pdf, bibtex.
EXPTIME Tableaux with Global Caching for Description Logics with Transitive Roles, Inverse Roles and Role Hierarchies, R. Goré and L.A. Nguyen. In N. Olivetti (Ed.), Proceedings of TABLEAUX 2007, LNAI 4548, pages 133-148. Springer, 2007.
pdf, bibtex.
EXPTIME Tableaux for ALC Using Sound Global Caching, R. Goré and L.A. Nguyen. In D. Calvanese et al. (Eds.), Proceedings of Description Logics 2007, pages 299-306.
pdf, bibtex.
A Tableau System with Automaton-Labelled Formulae for Regular Grammar Logics, R. Goré and L.A. Nguyen. In B. Beckert, editor, Proceedings of TABLEAUX 2005, LNAI 3702, pages 138-152. Springer, 2005.
pdf, bibtex.
Analytic Tableau Systems for Propositional Bimodal Logics of Knowledge and Belief, L.A. Nguyen. In U. Egly and C.G. Fermuller (eds.): TABLEAUX 2002, LNAI 2381, pp. 206-220, 2002. Springer.
pdf, ps.gz, bibtex.
Analytic Tableau Systems and Interpolation for the Modal Logics KB, KDB, K5, KD5, L.A. Nguyen. Studia Logica, 69(1), 2001, 41-57.
pdf, ps.gz, bibtex.
Sequent-Like Tableau Systems with the Analytic Superformula Property for the Modal Logics KB, KDB, K5, KD5, L.A. Nguyen. In R. Dyckhoff, editor, Proceedings of TABLEAUX 2000, LNAI 1847, 341-351. Springer, 2000.
pdf, ps.gz, bibtex.
Clausal Tableau Systems and Space Bounds for the Modal Logics K, D, T, KB, KDB and B, Linh Anh Nguyen. Report TR 00-01(261), Institute of Informatics, University of Warsaw, 2000.
ps.gz, pdf, bibtex.
A New Space Bound for the Modal Logics K4, KD4, and S4, L.A. Nguyen. In M. Kutylowski, L. Pacholski, T. Wierzbicki, editors, Proceedings of the MFCS'99, LNCS 1672, 321-331. Springer, 1999.
pdf, ps.gz, bibtex.

Rule Languages for Modal and Description Logics

Horn Fragments of Modal and Description Logics

An expressive and tractable rule-based description language, L.A. Nguyen and N.-T. Nguyen. Enterprise Information Systems, 13:7-8, 1069-1093 (2019), DOI:10.1080/17517575.2019.1636143.
the original and correct version, without typos and problems caused by the typing editor of TEIS.
A Tractable Rule Language in the Modal and Description Logic that Combines CPDL with Regular Grammar Logic, L.A. Nguyen. Fundamenta Informaticae 143(1-2): 113-139 (2016).
a revised version.
Towards richer rule languages with polynomial data complexity for the Semantic Web, L.A. Nguyen, T.-B.-L. Nguyen and A. Szałas. Data & Knowledge Engineering 96: 57-77 (2015).
a revised version.
On the Web Ontology Rule Language OWL 2 RL, S.T. Cao, L.A. Nguyen and A. Szałas. In Proceedings of ICCCI'2011, LNAI 6922, pages 254-264, Springer, 2011.
a revised and extended version, bibtex.
Horn Knowledge Bases in Regular Description Logics with PTIME Data Complexity, L.A. Nguyen. Fundamenta Informaticae, 104(4), 2010, 349-384.
pdf, bibtex.
Tractable Approximate Knowledge Fusion Using the Horn Fragment of Serial Propositional Dynamic Logic, B. Dunin-Kęplicz, L.A. Nguyen and A. Szałas. Int. J. Approx. Reasoning 51(3), pp. 346-362, 2010.
pdf, bibtex.
Fusing Approximate Knowledge from Distributed Sources, B. Dunin-Kęplicz, L.A. Nguyen, and A. Szałas. In Proceedings of IDC'2009, Studies in Computational Intelligence 237, pages 75-86, Springer, 2009.
pdf, bibtex.
Extending the Description Horn Logic DHL, L.A. Nguyen. In L. Czaja and M. Szczuka, editors, Proceedings of CS&P'2009, pages 419-430, 2009.
pdf, bibtex, talk-slides.
Constructing Finite Least Kripke Models for Positive Logic Programs in Serial Regular Grammar Logics, L.A. Nguyen. Logic Journal of IGPL 2008 16: 175-193.
pdf, bibtex.
Weakening Horn Knowledge Bases in Regular Description Logics to Have PTIME Data Complexity, L.A. Nguyen. In S. Ghilardi et al. (Eds.), Proceedings of ADDCT 2007, pages 32-47.
pdf, bibtex, talk-slides.
Approximating Horn Knowledge Bases in Regular Description Logics to Have PTIME Data Complexity, L.A. Nguyen. In V. Dahl and I. Niemela (Eds.), Proceedings of ICLP 2007, LNCS 4670, pages 438-439. Springer, 2007.
pdf, bibtex.
On the Deterministic Horn Fragment of Test-free PDL, L.A. Nguyen. In I. Hodkinson and Y. Venema, editors, Advances in Modal Logic - Volume 6, pages 373-392 King's College Publications, 2006.
ps, bibtex, talk-slides.
A Bottom-up Method for the Deterministic Horn Fragment of the Description Logic ALC, L.A. Nguyen. In M. Fisher et al. (Eds), Proceedings of JELIA 2006, LNAI 4160, pages 346-358. Springer, 2006.
pdf, long version, bibtex, talk-slides.
On the Complexity of Fragments of Modal Logics, L.A. Nguyen. In R. Schmidt, I. Pratt-Hartmann, M. Reynolds, H. Wansing, editors, Advances in Modal Logic - Volume 5, pages 249-268, King's College Publications, 2005.
pdf, ps.gz, bibtex.
Constructing the Least Models for Positive Modal Logic Programs, L.A. Nguyen. Fundamenta Informaticae, 42(1) 2000, 29-60.
pdf, ps.gz, bibtex.

Modal Logic Programming

Foundations of Modal Logic Programming: The Direct Approach, Linh Anh Nguyen. Warsaw, November 2006 (last revised 2010-05-03: Release 2.2).
pdf, bibtex.
Modal Logic Programming Revisited, L.A. Nguyen. Journal of Applied Non-Classical Logics, 19(2), 2009, 167-181.
pdf, bibtex.
Multimodal Logic Programming, L.A. Nguyen. Theoretical Computer Science, 360 (2006), 247-288.
pdf, ps.gz, bibtex.
Reasoning about Epistemic States of Agents by Modal Logic Programming, L.A. Nguyen. In F. Toni and P. Torroni (eds), Proceedings of CLIMA VI, LNAI 3900, pages 37-56, Springer, 2006.
pdf, ps.gz, bibtex, talk-slides.
An SLD-Resolution Calculus for Basic Serial Multimodal Logics, L.A. Nguyen. In D.V. Hung and M. Wirsing, editors, Proceedings of ICTAC 2005, LNCS 3722, pages 151-165. Springer, 2005.
pdf, bibtex, talk-slides.
The Modal Logic Programming System MProlog, L.A. Nguyen. In J.J. Alferes and J.A. Leite, editors, Proceedings of JELIA 2004, LNCS 3229, pages 266-278, Springer, 2004.
pdf, ps.gz, bibtex.
MProlog: An Extension of Prolog for Modal Logic Programming, L.A. Nguyen. In B. Demoen and V. Lifschitz, editor, Proceedings of ICLP 2004, LNCS 3132, pages 469-470. Springer, 2004.
A Fixpoint Semantics and an SLD-Resolution Calculus for Modal Logic Programs, L.A. Nguyen. Fundamenta Informaticae, 55(1), 2003, 63-100.
pdf, ps.gz, bibtex.

Modal Deductive Databases

Foundations of Modal Deductive Databases, L.A. Nguyen. Fundamenta Informaticae, 79(1-2), 2007, 85-135.
pdf, bibtex.
The Data Complexity of MDatalog in Basic Modal Logics, L.A. Nguyen. In R. Kralovic and P. Urzyczyn, editors, Proceedings of MFCS 2006, LNCS 4162, pages 729-740. Springer, 2006.
pdf, bibtex, talk-slides.
On Modal Deductive Databases, L.A. Nguyen. In J. Eder, H.-M. Haav, A. Kalja, and J. Penjam, editors, Proceedings of ADBIS 2005, LNCS 3631, pages 43-57. Springer, 2005.
pdf, ps.gz, bibtex, talk-slides.
The Modal Query Language MDatalog, L.A. Nguyen. Fundamenta Informaticae, 46(4), 2001, 315-342.
pdf, ps.gz, bibtex.

Nonmonotonic Rule Languages

WORL: a Web Ontology Rule Language, S.T. Cao, L.A. Nguyen and A. Szałas. In Proceedings of KSE'2011, pages 32-39, IEEE Computer Society, 2011.
a revised and extended version, bibtex.

Description Logics and Semantic Web

On Designing the SONCA System, L.A. Nguyen and H.S. Nguyen. Studies in Computational Intelligence 390, pages 9-36, Springer-Verlag, 2012.

Concept Learning in Description Logics

On C-Learnability in Description Logics, A.R. Divroodi, Q.-T. Ha, L.A. Nguyen and H.S. Nguyen. In Proceedings of ICCCI'2012, LNAI 7653(1), pages 230-238, Springer-Verlag, 2012.
pdf.
A Bisimulation-based Method of Concept Learning for Knowledge Bases in Description Logics, Q.-T. Ha, T.-L.-G. Hoang, L.A. Nguyen, H.S. Nguyen, A. Szałas and T.-L. Tran. In Proceedings of SoICT'2012, pages 241-249, ACM, 2012.
pdf.
Concept Learning for Description Logic-based Information Systems, T.-L. Tran, Q.-T. Ha, T.-L.-G. Hoang, L.A. Nguyen, H.S. Nguyen and A. Szałas. In Proceedings of KSE'2012, pages 65-73, IEEE Computer Society, 2012.
pdf, bibtex.
Logic-based Roughification, L.A. Nguyen and A. Szałas. In: Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam (vol. I), Intelligent Systems Reference Library 42, pages 529-556, Springer-Verlag, 2013.
pdf.
On Bisimulations for Description Logics, A.R. Divroodi and L.A. Nguyen. In Proceedings of CS&P'2011, pages 99-110, 2011.
a revised and extended version, bibtex.

Paraconsistent Semantics and Reasoning in Description Logics

Paraconsistent Reasoning for Semantic Web Agents, L.A. Nguyen and A. Szałas. Transactions on Computational Collective Intelligence 6 (LNCS 7190), pages 36-55, 2012.
pdf, bibtex.
Paraconsistent and Approximate Semantics for the OWL 2 Web Ontology Language, L.A. Nguyen. RSCTC 2010, 7th International Conference on Rough Sets and Current Trends in Computing, LNAI 6086, pp. 710-720, Springer, 2010.
a revised and extended version, bibtex, talk-slides.
Three-Valued Paraconsistent Reasoning for Semantic Web Agents, L.A. Nguyen and A. Szałas. 4th International KES Symposium on Agents and Multi-Agent Systems, LNAI 6070, pp. 152-162, Springer, 2010.
pdf, bibtex.

Multiagent Systems and Artificial Intelligence

Converse-PDL with Regular Inclusion Axioms: A Framework for MAS Logics, B. Dunin-Kęplicz, L.A. Nguyen and A. Szałas. J. Applied Non-Classical Logics, 21(1), 2011, 61-91.
A Framework for Graded Beliefs, Goals and Intentions, B. Dunin-Kęplicz, L.A. Nguyen and A. Szałas. Fundamenta Informaticae 100, 2010, 53-76.
pdf, bibtex.
Graded Beliefs, Goals and Intentions, B. Dunin-Kęplicz, L.A. Nguyen and A. Szałas. 3rd Workshop on Logical Aspects of Multi-Agent Systems, AAAI, 2010.
A Layered Rule-Based Architecture for Approximate Knowledge Fusion, B. Dunin-Kęplicz, L.A. Nguyen and A. Szałas. Computer Science and Information Systems, 7(3), 2010, 617-642.
pdf, bibtex.

Deductive Databases and Logic Programming in Classical First-Order Logic

Deductive Databases in Classical First-Order Logic

Query-Subquery Nets, L.A. Nguyen and S.T. Cao. In Proceedings of ICCCI'2012, LNAI 7653(1), pages 239-248, Springer-Verlag, 2012.
long version.
A Generalized QSQR Evaluation Method for Horn Knowledge Bases, E. Madalinska-Bugaj and L.A. Nguyen. To appear in ACM Transactions on Computational Logic 13(4), 2012.
pdf.
Generalizing the QSQR Evaluation Method for Horn Knowledge Bases, E. Madalinska-Bugaj and L.A. Nguyen. In N.T. Nguyen and R. Katarzyniak (Eds.), New Challenges in Applied Intelligence Technologies, volume 134 of Studies in Computational Intelligence, page 145-154, Springer, 2008.
bibtex.

Logic Programming in Classical First-Order Logic

Negative Ordered Hyper-Resolution as a Proof Procedure for Disjunctive Logic Programming, L.A. Nguyen. Fundamenta Informaticae, 70(4), 2006, 351-366.
pdf, ps.gz, bibtex.
Completeness of Hyper-Resolution via the Semantics of Disjunctive Logic Programs, L.A. Nguyen and R. Goré. Information Processing Letters, 95(2), 2005, 363-369.
pdf, ps.gz, bibtex.
Negative Hyper-Resolution as Procedural Semantics of Disjunctive Logic Programs, L.A. Nguyen. In J.J. Alferes and J.A. Leite, editors, Proceedings of JELIA 2004, LNCS 3229, pages 565-577, Springer, 2004.
pdf, ps.gz, bibtex.

Theses

Selected Semantic and Computational Aspects of Modal Logic Programming, Linh Anh Nguyen. Habilitation thesis, Institute of Informatics, University of Warsaw, 2009.
summary, autoreferat.
Results on Modal Reasoning with Applications to Modal Deductive Databases, Linh Anh Nguyen. Ph.D. thesis (adviser: prof. Andrzej Szałas), Institute of Informatics, University of Warsaw, 2000.
ps.gz, bibtex; a summary: html, ps.gz; autoreferat: html, ps.gz.
Algorytmy deskolemizacji i ich zastosowania, Linh Anh Nguyen. (M.Sc. thesis - in Polish) Praca magisterska napisana pod opieką prof. Andrzeja Szałasa, 1997.
ps.gz.