epcl.bib

@inproceedings{bagheri-hariri.calvanese.ea:13,
  title = {Verification of Semantically-Enhanced Artifact Systems},
  year = {2013},
  author = {Bagheri Hariri, Babak and Diego Calvanese and Marco
		  Montali and Ario Santoso and Dmitry Solomakhin},
  booktitle = {Proceedings of the 11th International Conference on Service Oriented Computing
		  (ICSOC 2013)},
  publisher = {Springer},
  volume = {8272},
  url = {http://www.inf.unibz.it/~calvanese/papers/bagh-etal-ICSOC-2013.pdf},
  pages = {600--607},
  series = {LNCS}
}
@inproceedings{barahona.holldobler.ea:13,
  author = {Pedro Barahona and Steffen H{\"o}lldobler and Van Hau
		  Nguyen},
  title = {Translating the At-Most-One Constraint into {SAT}},
  booktitle = {The 19th International Conference on
Principles and Practice of
Constraint Programming (CP 2013), Doctoral Program},
  publisher = {Uppsala University},
  address = {Uppsala, Sweden},
  year = {2013},
  pages = {85--90},
  url = {http://cp2013.a4cp.org/sites/default/files/uploads/dp-2013-proceedings.pdf}
}
@inproceedings{barahona.holldobler.ea:14,
  author = { Pedro Barahona and Steffen H{\"o}lldobler and Van-Hau
		  Nguyen},
  title = {Representative Encodings to Translate Finite {CSPs} into
		  {SAT}},
  booktitle = {11th International International Conference on Integration
		  of Artificial Intelligence (AI) and Operations Research
		  (OR) techniques in Constraint Programming (CP) -- CPAIOR
		  2014, Cork, Ireland, May 19-23, 2014},
  year = {2014},
  note = {to appear}
}
@inproceedings{barahona.holldobler.ea:14*1,
  author = {Pedro Barahona and Steffen H{\"o}lldobler and Van-Hau
		  Nguyen},
  title = {Efficient {SAT}-Encoding of Linear {CSP} Constraints},
  booktitle = {13rd International Symposium on Artificial Intelligence
		  and Mathematics -- ISAIM, Fort Lauderdale, Florida, USA,
		  January 6-8, 2014},
  year = {2014},
  url = {http://www.cs.uic.edu/pub/Isaim2014/WebPreferences/ISAIM2014_Barahona_etal.pdf},
  note = {to appear}
}
@inproceedings{calvanese.de-giacomo.ea:12,
  title = {Semantically-Governed Data-Aware Processes},
  year = {2012},
  author = {Diego Calvanese and De Giacomo, Giuseppe and Domenico
		  Lembo and Marco Montali and Ario Santoso},
  booktitle = {Proceedings of the 1st International Workshop on Knowledge-intensive
		  Business Processes (KiBP 2012)},
  pages = {21--32},
  volume = {861},
  url = {http://www.inf.unibz.it/~calvanese/papers/calv-etal-KiBP-2012.pdf},
  abstract = {In this paper we consider processes that run over data
		  stored in a relational database. Our setting is that of
		  ontology-based data access (OBDA), where the information in
		  the database is conceptually represented as an ontology and
		  is declaratively mapped to it through queries. We are
		  interested in verifying temporal logic formulas on the
		  evolution of the information at the conceptual level,
		  taking into account the knowledge present in the ontology,
		  which allows for deducing information that is only
		  implicitly available. Specifically, we show how, building
		  on first-order rewritability of queries over the system
		  state that is typical of ontology languages for OBDA, we
		  are able to reformulate the temporal properties into
		  temporal properties expressed over the underlying database.
		  This allows us adopt notable decidability results on
		  verification of evolving databases that have been
		  established recently},
  publisher = {CEUR Electronic Workshop Proceedings, http://ceur-ws.org/}
}
@incollection{calvanese.de-giacomo.ea:12*1,
  author = {Calvanese, Diego and De Giacomo, Giuseppe and Lembo,
		  Domenico and Montali, Marco and Santoso, Ario},
  affiliation = {Free University of Bozen-Bolzano, Italy},
  title = {Ontology-Based Governance of Data-Aware Processes},
  booktitle = {Web Reasoning and Rule Systems (RR 2012)},
  series = {LNCS},
  editor = {Kr\"{o}tzsch, Markus and Straccia, Umberto},
  publisher = {Springer},
  isbn = {978-3-642-33202-9},
  keyword = {Computer Science},
  pages = {25--41},
  volume = {7497},
  url = {http://www.inf.unibz.it/~calvanese/papers/calv-etal-RR-2012.pdf},
  abstract = {In this paper we show how one can use the technology
		  developed recently for Ontology-Based Data Access (OBDA) to
		  govern data-aware processes through ontologies. In
		  particular, we consider processes executed over a
		  relational database which issue calls to external services
		  to acquire new information and update the data.We equip
		  these processes with an OBDA system, in which an ontology
		  modeling the domain of interest is connected through
		  declarative mappings to the database, and that consequently
		  allows one to understand and govern the manipulated
		  information at the conceptual level. In this setting, we
		  are interested in verifying first-order μ -calculus
		  formulae specifying temporal properties over the evolution
		  of the information at the conceptual level. Specifically,
		  we show how, building on first-order rewritability of
		  queries over the system state that is typical of OBDA, we
		  are able to reformulate the temporal properties into
		  temporal properties expressed over the underlying database.
		  This allows us to adopt notable decidability results on
		  verification of evolving databases that have been
		  established recently.},
  year = {2012}
}
@inproceedings{calvanese.kharlamov.ea:13,
  title = {Verification of Inconsistency-Aware Knowledge and Action
		  Bases},
  year = {2013},
  author = {Diego Calvanese and Evgeny Kharlamov and Marco Montali and
		  Ario Santoso and Dmitriy Zheleznyakov},
  url = {http://www.inf.unibz.it/~calvanese/papers/calv-etal-IJCAI-2013.pdf},
  booktitle = {Proceedings of the 23rd International Joint Conference on Artificial
		  Intelligence (IJCAI 2013)},
  page = {810--817}
}
@inproceedings{calvanese.kharlamov.ea:13*1,
  title = {Verification of Inconsistency-Aware Knowledge and Action
		  Bases},
  year = {2013},
  author = {Diego Calvanese and Evgeny Kharlamov and Marco Montali and
		  Ario Santoso and Dmitriy Zheleznyakov},
  booktitle = {Proceedings of the 26th International Workshop on Description Logics (DL
		  2013)},
  pages = {107--119},
  volume = {1014},
  url = {http://www.inf.unibz.it/~calvanese/papers/calv-etal-DL-2013.pdf},
  series = {CEUR Electronic Workshop Proceedings,
		  http://ceur-ws.org/}
}
@inproceedings{calvanese.santoso:12,
  title = {Best Service Synthesis in the Weighted Roman Model},
  year = {2012},
  author = {Diego Calvanese and Ario Santoso},
  booktitle = {Proceedings of the 4th Central-European Workshop on Services and
		  their Composition (ZEUS 2012)},
  pages = {42--49},
  volume = {847},
  url = {http://www.inf.unibz.it/~calvanese/papers/calv-sant-ZEUS-2012.pdf},
  abstract = {This paper presents an extension of a framework for
		  synthesizing a composition of services, named Roman Model,
		  such that it is able to model the best service composition
		  synthesis problem. In such extension, which we call the
		  Weighted Roman Model, the services are modeled as Weighted
		  Transition Systems so that one can capture the cost of
		  operations executed by a service. Within this setting, we
		  can make a comparison among all possible compositions of
		  the available services by considering the total cost of
		  operation execution performed by each possible composition
		  of services for each interaction between the service and
		  the client. Besides defining the notion of best
		  composition, we also propose an algorithm for synthesizing
		  the best composition and show that it is sound and
		  complete. Finally, we propose an extension of WSDL to
		  capture the Weighted Roman Model},
  publisher = {CEUR Electronic Workshop Proceedings, http://ceur-ws.org}
}
@incollection{santoso:12,
  author = {Ario Santoso},
  affiliation = {KRDB Research Centre, Faculty of Computer Science, Free
		  University of Bozen/Bolzano, Piazza Domenicani, 3, I-39100
		  Bolzano, Italy},
  title = {When Data, Knowledge and Processes Meet Together},
  booktitle = {Web Reasoning and Rule Systems (RR 2012)},
  series = {LNCS},
  editor = {Kr\"{o}tzsch, Markus and Straccia, Umberto},
  publisher = {Springer},
  isbn = {978-3-642-33202-9},
  keyword = {Computer Science},
  pages = {291--296},
  volume = {7497},
  url = {http://dx.doi.org/10.1007/978-3-642-33203-6\_34},
  abstract = {The aim of this work is to investigate the integration of
		  data, knowledge, and processes. In particular, we study the
		  combination of research in Ontology-Based Data Access
		  (OBDA) with Data- Centric Dynamic Systems (DCDSs). The idea
		  of OBDA is to combine data and knowledge by providing a
		  conceptual view over data repositories in terms of an
		  ontology, while DCDSs provide a holistic framework for
		  modeling business processes in which both data and
		  processes are treated as first-class citizens. Thanks to
		  this combination, we obtain Semantically-Governed
		  Data-Aware Processes (SGDAPs), which represent a
		  significant step towards the envisioned unifying framework.
		  We position SGDAPs in the state of the art and briefly
		  discuss the current status of our research. We then
		  identify several research directions along which we intend
		  to continue our work.},
  year = {2012}
}
@inproceedings{dahl.egilmez.ea:13,
  author = {Veronica Dahl and Sinan Egilmez and Joao Martins and
		  Emilio Miralles},
  title = {On Failure-Driven Constraint-Based Parsing through
		  {CHRG}},
  pages = {13--24},
  keywords = {linguistics},
  booktitle = {Tenth International Workshop on Constraint Handling Rules
		  (CHR '13)},
  year = {2013},
  publisher = {K.U.Leuven, Department of Computer Science},
  series = {Technical report},
  number = {CW 641},
  address = {Leuven},
  url = {http://dtai.cs.kuleuven.be/CHR/papers/chr2013/02-Dahl-chr13.pdf}
}
@inproceedings{dietz.holldobler.ea:12,
  author = {Dietz, Emmanuelle-Anna and H\"{o}lldobler, Steffen and
		  Ragni, Marco},
  title = {A Computational Logic Approach to the Suppression Task},
  booktitle = {Proceedings of the 34th Annual Conference of the Cognitive Science
		  Society},
  editor = {N. Miyake and D. Peebles and R. P. Cooper},
  publisher = {Cognitive Science Society},
  year = {2012},
  pages = {1500--1505},
  url = {http://mindmodeling.org/cogsci2012/papers/0266/paper0266.pdf}
}
@inproceedings{dietz.holldobler.ea:12*1,
  author = {Dietz, Emmanuelle-Anna and H\"{o}lldobler, Steffen and
		  Ragni, Marco},
  title = {A Simple Model for the {W}ason Selection Task},
  booktitle = {Human Reasoning and Automated Deduction: KI 2012 workshop
		  proceedings},
  editor = {Barkowsky, T. and Ragni, M. and Stolzenburg, F.},
  year = {2012},
  url = {http://www.sfbtr8.spatial-cognition.de/papers/SFB\_TR8Rep032-09\_2012.pdf}
}
@inproceedings{dietz.holldobler.ea:13,
  author = {Dietz, Emmanuelle-Anna and H\"{o}lldobler, Steffen and
		  Ragni, Marco},
  title = {A Computational Logic Approach to the Abstract and the
		  Social Case of the Selection Task},
  booktitle = {Proceedings of the 11th International Symposium on Logical
		  Formalizations of Commonsense Reasoning,
		  {COMMONSENSE~2013}},
  year = {2013},
  url = {http://www.commonsense2013.cs.ucy.ac.cy/docs/commonsense2013_submission_15.pdf}
}
@article{dietz.holldobler.ea:14,
  author = {Dietz, Emmanuelle-Anna and H\"{o}lldobler, Steffen and
		  Wernhard, Christoph},
  title = {Modeling the Suppression Task under Weak Completion and
		  Well-Founded Semantics},
  journal = {Journal of Applied Non-Classical Logics},
  year = {2014},
  note = {accepted for publication}
}
@inproceedings{dietz.holldobler:12,
  author = {Dietz, Emmanuelle-Anna and H\"{o}lldobler, Steffen},
  title = {Modeling the Suppression Task under Three-valued
		  {\L}ukasiewicz and Well-founded Semantics},
  booktitle = {Proceedings of the ESSLLI 2012 Workshop on Trivalent Logics and their
		  Applications},
  editor = {Egr\'{e}, P. and Ripley, R.},
  year = {2012},
  pages = {27--36},
  url = {http://paulegre.free.fr/TrivalentESSLLI/esslli\_trivalent\_proceedings1.pdf}
}
@inproceedings{egilmez.martins.ea:14,
  author = {Sinan Egilmez and Joao Martins and Joao Leite},
  title = {Extending social abstract argumentation with votes on
		  attacks},
  booktitle = {2nd International Workshop on Theory and Applications of
		  Formal Argumentation (TAFA'13)},
  series = {LNCS},
  publisher = {Springer},
  volume = {8306},
  year = {2014},
  pages = {16--31},
  url = {http://link.springer.com/chapter/10.1007%2F978-3-642-54373-9_2}
}
@inproceedings{franconi.kerhet.ea:12,
  author = {Franconi, Enrico and Kerhet, Volha and Ngo, Nhung},
  title = {Exact query reformulation with first-order ontologies and
		  databases},
  booktitle = {Proceedings of the 13th European conference on Logics in
		  Artificial Intelligence (JELIA'12)},
  year = {2012},
  isbn = {978-3-642-33352-1},
  location = {Toulouse, France},
  pages = {202--214},
  numpages = {13},
  url = {http://link.springer.com/chapter/10.1007%2F978-3-642-33353-8_16},
  doi = {10.1007/978-3-642-33353-8\_16},
  acmid = {2405388},
  publisher = {Springer}
}
@inproceedings{franconi.kerhet.ea:12*1,
  author = {Enrico Franconi and Volha Kerhet and Nhung Ngo},
  title = {Exact Query Reformulation over $\mathcal{SHOQ}$ {DB}oxes},
  booktitle = {International Workshop on Description Logics (DL 2012)},
  year = {2012},
  url = {http://ceur-ws.org/Vol-846/paper_64.pdf},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  publisher = {CEUR Electronic Workshop Proceedings, http://ceur-ws.org}
}
@article{franconi.kerhet.ea:13,
  author = {Enrico Franconi and Volha Kerhet and Nhung Ngo},
  title = {Exact Query Reformulation over Databases with First-order
		  and Description Logics Ontologies},
  journal = {Journal of Artificial Intelligence Research},
  year = {2013},
  url = {http://www.jair.org/media/4058/live-4058-7533-jair.pdf},
  volume = {48},
  pages = {885--922}
}
@inproceedings{franconi.ngo.ea:12,
  author = {Franconi, Enrico and Ngo, Nhung and Sherkhonov, Evgeny},
  title = {The definability abduction problem for data exchange},
  booktitle = {Web Reasoning and Rule Systems (RR 2012)},
  year = {2012},
  isbn = {978-3-642-33202-9},
  location = {Vienna, Austria},
  pages = {217--220},
  numpages = {4},
  url = {http://link.springer.com/chapter/10.1007%2F978-3-642-33203-6_18},
  doi = {10.1007/978-3-642-33203-6\_18},
  acmid = {2415134},
  publisher = {Springer}
}
@inproceedings{haan.kanj.ea:13,
  author = {Ronald de Haan and Iyad A. Kanj and Stefan Szeider},
  title = {Local Backbones},
  booktitle = {Proceedings of the 16th International Conference on Theory
		  and Applications of Satisfiability Testing (SAT '13)},
  year = {2013},
  pages = {377--393},
  ee = {http://dx.doi.org/10.1007/978-3-642-39071-5_28},
  editor = {Matti J{\"a}rvisalo and Allen Van Gelder},
  publisher = {Springer},
  series = {LNCS},
  volume = {7962},
  isbn = {978-3-642-39070-8},
  url = {http://sat2013.cs.helsinki.fi/}
}
@inproceedings{haan.narodytska.ea:12,
  author = {Ronald de Haan and Nina Narodytska and Toby Walsh},
  title = {The {R}egular{GCC} Matrix Constraint},
  editor = {Dongmo Zhang and Michael Thielscher},
  booktitle = {Australasian Conference on Artificial Intelligence},
  address = {Sydney, Australia},
  publisher = {Springer},
  series = {LNCS},
  volume = {7691},
  year = {2012},
  pages = {206--217},
  url = {http://link.springer.com/chapter/10.1007%2F978-3-642-35101-3\_18}
}
@inproceedings{haan.roshchin:12,
  author = {Ronald de Haan and Mikhail Roshchin},
  title = {Detecting Temporally Related Arithmetical Patterns: an
		  Extension of Complex Event Processing},
  editor = {Joaquim Filipe and Ana L. N. Fred},
  booktitle = {Proceedings of the International Conference on Knowledge Discovery and
		  Information Retrieval},
  address = {Barcelona, Spain},
  publisher = {SciTePress},
  year = {2012},
  url = {http://ai2012.web.cse.unsw.edu.au/}
}
@inproceedings{haan.roubckova.ea:13,
  author = {Ronald de Haan and Anna Roub\'{\i}ckov{\'a} and Stefan
		  Szeider},
  title = {Parameterized Complexity Results for Plan Reuse},
  ee = {http://www.aaai.org/ocs/index.php/AAAI/AAAI13/paper/view/6411},
  editor = {Marie desJardins and Michael L. Littman},
  booktitle = {Proceedings of the Twenty-Seventh AAAI Conference on
		  Artificial Intelligence (AAAI '13)},
  publisher = {AAAI Press},
  year = {2013},
  isbn = {978-1-57735-615-8},
  url = {http://www.aaai.org/Conferences/AAAI/aaai13.php}
}
@inproceedings{haan:12,
  author = {Ronald de Haan},
  title = {Reasoning on Procedural Programs using Description Logics
		  with Concrete Domains},
  booktitle = {Proceedings of the ESSLLI 2012 Student Session, Opole, Poland,
		  August 6-17, 2012},
  editor = {Rendsvig, R.K. and Katenko, S.},
  year = {2012},
  pages = {32--42},
  url = {http://ceur-ws.org/Vol-954/paper4.pdf}
}
@mastersthesis{haan:12*1,
  author = {Ronald de Haan},
  title = {Description Logic Based Reasoning on Programming
		  Languages},
  school = {Technische Universit\"{a}t Wien},
  year = {2012},
  url = {http://www.ronalddehaan.eu/files/rdhmscthesis.pdf}
}
@inproceedings{haan:14,
  author = {Ronald de Haan and
               Stefan Szeider},
  title = {The Parameterized Complexity of Reasoning Problems Beyond {NP}},
  editor = {Chitta Baral and
                    Giuseppe {De Giacomo} and
                    Thomas Eiter},
  booktitle = {Principles of Knowledge Representation and Reasoning: Proceedings
               of the Fourteenth International Conference, KR 2014,
               Vienna, Austria, July 20-24, 2014},
  publisher = {AAAI Press},
  note = {to appear},
  year = {2014},
  url = {http://arxiv.org/pdf/1312.1672v1.pdf}
}
@inproceedings{holldobler.manthey.ea:12,
  author = {H{\"o}lldobler, Steffen and N. Manthey and V.H. Nguyen and
		  P. Steinke},
  title = {Solving Hidokus using {SAT} Solvers},
  booktitle = {Proceedings of the INFOCOM-5},
  pages = {208--212},
  year = {2012},
  url = {http://www.wv.inf.tu-dresden.de/Publications/2012/}
}
@techreport{holldobler.nguyen:12,
  author = {H{\"o}lldobler, Steffen and Nguyen, Van Hau},
  title = {An Efficient Encoding of the At-Most-One Constraint},
  institution = {Knowledge Representation and Reasoning Group},
  address = {Technische Universit{\"a}t Dresden, 01062 Dresden,
		  Germany},
  year = {2012},
  url = {http://www.wv.inf.tu-dresden.de/Publications/2013/}
}
@inproceedings{holldobler.nguyen:13,
  author = { Steffen H{\"o}lldobler and Van Hau Nguyen},
  title = {On {SAT}-Encodings of the At-Most-One Constraint},
  editor = {George Katsirelos and Claude-Guy Quimper},
  booktitle = {Proceedings of the Twelfth International Workshop on Constraint
		  Modelling and Reformulation},
  publisher = {Uppsala University, Sweden, September 16-20},
  pages = {1--17},
  url = {http://www2.ift.ulaval.ca/~quimper/publications/modref2013.pdf},
  year = {2013}
}
@article{ngo.franconi:13,
  author = {Ngo, Nhung and Franconi, Enrico},
  title = {Getting Unique Solution in Data Exchange},
  journal = {Proceedings of the VLDB Endowment},
  issue_date = {August 2013},
  volume = {6},
  number = {12},
  month = aug,
  year = {2013},
  issn = {2150-8097},
  pages = {1440--1443},
  numpages = {4},
  url = {http://www.vldb.org/pvldb/vol6/p1440-ngo.pdf}
}
@inproceedings{nguyen.velev.ea:13,
  author = { Van Hau Nguyen and Miroslav N. Velev and Pedro Barahona},
  title = {Application of Hierarchical Hybrid Encodings to Efficient
		  Translation of {CSPs} to {SAT}},
  booktitle = {Proceedings of the IEEE-ICTAI2013, Special Track on SAT and CSP,
		  Washington DC, USA, November, 2013},
  year = {2013},
  url = {http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=06735365}
}
@inproceedings{nhung.phuong:12,
  author = {Ngo Phuong Nhung and Tu Minti Phuong},
  title = {Using similarity learning to improve network-based gene
		  function prediction},
  booktitle = {IEEE International Conference on Bioinformatics and Biomedicine},
  isbn = {978-1-4673-2559-2},
  year = {2012},
  pages = {1--6},
  doi = {http://doi.ieeecomputersociety.org/10.1109/BIBM.2012.6392663},
  publisher = {IEEE Computer Society},
  address = {Los Alamitos, CA, USA},
  url = {http://www.computer.org/csdl/proceedings/bibm/2012/2559/00/06392663-abs.html}
}
@article{phuong.nhung:13,
  author = {Tu Minh Phuong and Ngo Phuong Nhung},
  title = {Predicting gene function using similarity learning},
  journal = {BMC Genomics},
  year = {2013},
  volume = {14},
  number = {Suppl 4},
  url = {http://link.springer.com/article/10.1186%2F1471-2164-14-S4-S4}
}
@article{revenko.kuznetsov:12,
  author = {Artem Revenko and Sergei O. Kuznetsov},
  title = {Attribute Exploration of Properties of Functions on Sets},
  journal = {Fundamenta Informaticae},
  volume = {115},
  number = {4},
  year = {2012},
  pages = {377--394},
  ee = {http://dx.doi.org/10.3233/FI-2012-660},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  url = {http://iospress.metapress.com/content/l43h78717k112752/}
}
@inproceedings{revenko.kuznetsov:12*1,
  author = {A. Revenko and S. O. Kuznetsov},
  year = 2012,
  title = {Finding Errors in New Object in Formal Contexts},
  booktitle = {International Workshop: What can FCA do for Artificial
		  Intelligence?},
  pages = {65--72},
  url = {http://ceur-ws.org/Vol-939/paper10.pdf}
}
@inproceedings{revenko.kuznetsov:12*2,
  author = {Artem Revenko and Sergei O. Kuznetsov},
  title = {Finding Errors in New Object Intents},
  booktitle = {International Conference on Concept Lattices and Applications (CLA
		  2012)},
  year = {2012},
  pages = {151--162},
  isbn = {978-84-695-5252-0},
  url = {http://ceur-ws.org/Vol-972/paper13.pdf}
}
@inproceedings{revenko:13*1,
  author = {A. Revenko},
  year = {2013},
  title = {Debugging Programs Using Formal Concept Analysis},
  booktitle = {International Workshop: Formal Concept Analysis meets Information
		  Retrieval, FCAIR 2013},
  publisher = {CEUR},
  url = {http://ceur-ws.org/Vol-977/},
  pages = {105--112}
}
@inproceedings{revenko:13*2,
  author = {A. Revenko},
  year = {2013},
  title = {Debugging Program Code Using Implicative Dependencies},
  booktitle = {International Workshop: What can FCA do for Artificial
		  Intelligence?, FCA4AI 2013},
  publisher = {CEUR},
  url = {http://ceur-ws.org/Vol-1058/paper5.pdf},
  pages = {27--39}
}
@article{revenko:13*3,
  author = {A. Revenko},
  title = {Detecting mistakes in binary data tables},
  journal = {Automatic Documentation and Mathematical Linguistics},
  year = {2013},
  issn = {0005-1055},
  volume = {47},
  number = {3},
  doi = {10.3103/S0005105513030047},
  url = {http://dx.doi.org/10.3103/S0005105513030047},
  publisher = {Springer US},
  keywords = {formal context; implication; mistake search},
  pages = {102--110},
  language = {English}
}
@inproceedings{savkovic.calvanese:12,
  author = {Ognjen Savkovic and Diego Calvanese},
  title = {Introducing Datatypes in DL-Lite},
  year = {2012},
  pages = {720--725},
  ee = {http://dx.doi.org/10.3233/978-1-61499-098-7-720},
  editor = {Luc De Raedt and Christian Bessi{\`e}re and Didier Dubois
		  and Patrick Doherty and Paolo Frasconi and Fredrik Heintz
		  and Peter J. F. Lucas},
  booktitle = {European Conference on Artificial Intelligence (ECAI 2012)},
  publisher = {IOS Press},
  series = {Frontiers in Artificial Intelligence and Applications},
  volume = {242},
  url = {http://ebooks.iospress.nl/publication/7059},
  abstract = {In Description Logics (DLs) and in the ontology-based data
		  access (OBDA) scenario, the use of actual datatypes (such
		  as those adopted in DBMSs) has received only limited
		  attention, although datatypes, with their predefined
		  semantics, might have a substantial impact on the
		  computational complexity of inference in ontology systems.
		  In this work we aim at overcoming these limitations, and
		  study the impact of adding datatypes to the OBDA scenario.
		  To this aim, we introduce a language for datatypes and we
		  define the notion of a datatype lattice, constituted by a
		  set of datatypes that depend on each other. We classify
		  lattices based into a hierarchy of three classes according
		  to distinguishing properties. and we establish a
		  theoretical framework for datatypes in the OBDA scenario,
		  based on three major components (a DL, a class of datatype
		  lattices, and a query language). We establish the
		  computational complexity of query answering for various
		  significant instantiations of this framework, as ranging
		  from FOL-rewritable to coNP in data complexity.}
}
@inproceedings{savkovic.paramita.ea:12,
  author = {Ognjen Savkovic and Mirza Paramita and Sergey Paramonov
		  and Werner Nutt},
  title = {MAGIK: managing completeness of data},
  booktitle = {ACM International Conference on Information and Knowledge Management
		  (CIKM2012)},
  year = {2012},
  pages = {2725--2727},
  ee = {http://doi.acm.org/10.1145/2396761.2398741},
  url = {http://dl.acm.org/citation.cfm?doid=2396761.2398741}
}