Now showing items 713-732 of 1009

  • A proof theory for DL-Lite 

    Calvanese, D; Kharlamov, E; Nutt, W (Bozen-Bolzano University Press, 2007)
    In this work we propose an alternative approach to inference in DL-Lite, based on a reduction to reasoning in an extension of function-free Horn Logic (EHL). We develop a calculus for EHL and prove its soundness and ...
  • A proposed method to evaluate and compare fault predictions across studies 

    Russo, B (ACM, 2014)
    Studies on fault prediction often pay little attention to empirical rigor and presentation. Researchers might not have full command over the statistical method they use, full understanding of the data they have, or tend ...
  • Proposing measurements in dynamic systems 

    Gamper J; Nejdl W (Morgan Kaufmann Publishers, 1995)
    Proposing measurements in diagnosis systems for static systems is a well understood task. Usually, entropy based approaches are used, sometimes extended by cost and other considerations. How to do the same task in dynamic ...
  • PROSET - A Language for Prototyping with Sets 

    Doberkat E; Franke W; Gutenbeil U; Hasselbring W; Lammers U; Pahl C (IEEE, 1992)
    We discuss the prototyping language PROSET(Prototyping with Sets) as a language for experimental and evolutionary prototyping, focusing its attention on algorithm design. Some of PROSET's features include generative ...
  • Protocol specification and verification by using computational logic 

    Alberti, M; Ciampolini, A; Chesani, F; Mello, P; Montali, M; Storari, S; Torroni, P (Pitagora Editrice, 2005)
    The aim of this paper is to report on some preliminary results obtained in the context of the MASSIVE research project (http://www.di.unito.it/massive/) relating the formal specification and verification of ...
  • Prototyping for Investigating Affective Objects with and for Children 

    Gennari R; Melonio A; Ugur Yavuz S (CEUR-WS.org, 2018)
    If designers give users the means to create or experience in- teractive prototypes with them, users can contribute and form realis- tic expectations and experiences. That is especially relevant in case of novel interactive ...
  • Prova: Rule-based Java Scripting for Distributed Web Applications: A Case Study in Bioinformatics 

    Kozlenkov, A; Penaloza, R; Nigam, V; Royer, L; Dawelbait, G; Schroeder, M (Springer-Verlag, 2006)
    Prova is a language for rule-based Java scripting to support information integration and agent programming on the web. Prova integrates Java with derivation and reaction rules supporting message exchange with various ...
  • PSPACE Automata for Description Logics 

    Hladik J; Peñaloza R (CEUR, 2006)
    Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this result can be improved, and we define two ...
  • Pstable semantics for logic programs with possibilistic ordered disjunction 

    Confalonieri R; Nieves J; Vázquez-Salceda J (Springer, 2009)
    In this paper we define the semantics for capturing possibilistic ordered disjunction programs based on pstable semantics. The pstable semantics, based on paraconsistent logic, allows to treat inconsistency programs. ...
  • Putting the Developer in-the-loop: an Interactive GA for Software Re-Modularization 

    Bavota, G; Carnevale, F; Oliveto, R; De Lucia, A; Di Penta, M (2012)
    This paper proposes the use of Interactive Genetic Algorithms (IGAs) to integrate developer’s knowledge in a re-modularization task. Specifically, the proposed algorithm uses a fitness composed of automatically-evaluated ...
  • Quality enhancement of quality-asymmetric multiview plus depth video by using virtual view 

    Jin Z; Tillo T; Luo L (IEEE, 2015)
    Currently, multiview video plus depth format is one of the most popular 3D data representations which enables to generate any required intermediate view in a certain range. However, in terms of encoding and decoding ...
  • Quantifiers in XQuery 

    May, N; Helmer, S; Moerkotte, G (IEEE Computer Society, 2003)
    We present algebraic equivalences that allow to unnest nested algebraic expressions containing quantifiers for order-preserving algebraic operators. We illustrate how these equivalences can be applied successfully to unnest ...
  • Query Answering in Ontologies under Preference Rankings 

    Ceylan I; Lukasiewicz T; Peñaloza R; Tifrea-Marciuska O (International Joint Conferences on Artificial Intelligence, 2017)
    We present an ontological framework, based on preference rankings, that allows users to express their preferences between the knowledge explicitly available in the ontology. Using this formalism, the answers for a given ...
  • Query Answering over Description Logic Ontologies 

    Calvanese D (Springer, 2014)
    Description Logics (DLs) provide the formal foundation for ontology languages, and they have been advocated as formalisms for modeling the domain of interest in various settings, including the Semantic Web, data and ...
  • Query Quality Prediction and Reformulation for Source Code Search: The Refoqus Tool 

    Haiduc S; De Rosa G; Bavota G; Oliveto R; De Lucia A; Marcus A (IEEE, 2013)
    Developers search source code frequently during their daily tasks, to find pieces of code to reuse, to find where to implement changes, etc. Code search based on text retrieval (TR) techniques has been widely used in the ...
  • Query rewriting in DL-Lite HN horn 

    Botoeva, E; Artale, A; Calvanese, D (CEUR-WS.org, 2010)
    In this paper we present practical algorithms for query answering and knowledge base satisfiability checking in DL-Lite (HN) horn, a logic from the extended DL-Lite family that contains horn concept inclusions and number ...
  • Query Stability in Monotonic Data-Aware Business Processes 

    Savkovic, O; Marengo, E; Nutt, W (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2016)
    Organizations continuously accumulate data, often according to some business processes. If one poses a query over such data for decision support, it is important to know whether the query is stable, that is, whether the ...
  • Query-Based Entailment and Inseparability for ALC Ontologies 

    Botoeva E; Lutz C; Ryzhikov V; Wolter F; Zakharyaschev M (AAAI Press, 2016)
    We investigate the problem whether two ALC knowledge bases are indistinguishable by queries over a given vocabulary. We give model-theoretic criteria and prove that this problem is undecidable for conjunctive queries (CQs) ...
  • Quest, an OWL 2 QL reasoner for ontology-based data access 

    Rodriguez-Muro M; Calvanese D (CEUR-WS.org, 2012)
    Abstract. Ontology Based Data Access (OBDA) has drawn considerable attention from the OWL and RDF communities. In OBDA, instance data is accessed by means of mappings, which state the relationship between the data in a ...
  • Quest: Efficient SPARQL-to-SQL for RDF and OWL 

    Rodriguez-Muro M; Hardi J; Calvanese D (CEUR-WS.org, 2012)