Relevant bibliographies by topics / Datamol

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Datamol'

Author: Grafiati
Published: 4 June 2021
Last updated: 9 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Datamol.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Datamol"

1

Eiter, Thomas, Georg Gottlob, and Heikki Mannila. "Disjunctive datalog." ACM Transactions on Database Systems 22, no. 3 (September 1997): 364–418. http://dx.doi.org/10.1145/261124.261126.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gottlob, Georg, Erich Grädel, and Helmut Veith. "Datalog LITE." ACM Transactions on Computational Logic 3, no. 1 (January 2002): 42–79. http://dx.doi.org/10.1145/504077.504079.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Grau, Bernardo Cuenca, Ian Horrocks, Mark Kaminski, Egor V. Kostylev, and Boris Motik. "Limit Datalog." ACM SIGMOD Record 48, no. 4 (February 25, 2020): 6–17. http://dx.doi.org/10.1145/3385658.3385660.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Deagustini, Cristhian Ariel D., Maria Vanina Martinez, Marcelo A. Falappa, and Guillermo R. Simari. "Datalog+- Ontology Consolidation." Journal of Artificial Intelligence Research 56 (August 30, 2016): 613–56. http://dx.doi.org/10.1613/jair.5131.

Full text
Abstract:
Knowledge bases in the form of ontologies are receiving increasing attention as they allow to clearly represent both the available knowledge, which includes the knowledge in itself and the constraints imposed to it by the domain or the users. In particular, Datalog± ontologies are attractive because of their property of decidability and the possibility of dealing with the massive amounts of data in real world environments; however, as it is the case with many other ontological languages, their application in collaborative environments often lead to inconsistency related issues. In this paper we introduce the notion of incoherence regarding Datalog± ontologies, in terms of satisfiability of sets of constraints, and show how under specific conditions incoherence leads to inconsistent Datalog± ontologies. The main contribution of this work is a novel approach to restore both consistency and coherence in Datalog± ontologies. The proposed approach is based on kernel contraction and restoration is performed by the application of incision functions that select formulas to delete. Nevertheless, instead of working over minimal incoherent/inconsistent sets encountered in the ontologies, our operators produce incisions over non-minimal structures called clusters. We present a construction for consolidation operators, along with the properties expected to be satisfied by them. Finally, we establish the relation between the construction and the properties by means of a representation theorem. Although this proposal is presented for Datalog± ontologies consolidation, these operators can be applied to other types of ontological languages, such as Description Logics, making them apt to be used in collaborative environments like the Semantic Web.
APA, Harvard, Vancouver, ISO, and other styles
5

Meskes, Michael. "Subsumption-stratified datalog." Journal of Logic Programming 36, no. 1 (July 1998): 55–90. http://dx.doi.org/10.1016/s0743-1066(97)10007-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Stüber, Torsten, and Heiko Vogler. "Weighted monadic datalog." Theoretical Computer Science 403, no. 2-3 (August 2008): 221–38. http://dx.doi.org/10.1016/j.tcs.2008.04.025.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ben-Shlomo, Y., J. Head, and A. J. Lees. "Mortality in DATATOP." Annals of Neurology 45, no. 1 (January 1999): 138–39. http://dx.doi.org/10.1002/1531-8249(199901)45:1<138::aid-art27>3.0.co;2-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

ALVIANO, MARIO, WOLFGANG FABER, NICOLA LEONE, and MARCO MANNA. "Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues." Theory and Practice of Logic Programming 12, no. 4-5 (July 2012): 701–18. http://dx.doi.org/10.1017/s1471068412000257.

Full text
Abstract:
AbstractDatalog is one of the best-known rule-based languages, and extensions of it are used in a wide context of applications. An important Datalog extension is Disjunctive Datalog, which significantly increases the expressivity of the basic language. Disjunctive Datalog is useful in a wide range of applications, ranging from Databases (e.g., Data Integration) to Artificial Intelligence (e.g., diagnosis and planning under incomplete knowledge). However, in recent years an important shortcoming of Datalog-based languages became evident, e.g. in the context of data-integration (consistent query-answering, ontology-based data access) and Semantic Web applications: The language does not permit any generation of and reasoning with unnamed individuals in an obvious way. In general, it is weak in supporting many cases of existential quantification. To overcome this problem, Datalog∃ has recently been proposed, which extends traditional Datalog by existential quantification in rule heads. In this work, we propose a natural extension of Disjunctive Datalog and Datalog∃, called Datalog∃,˅, which allows both disjunctions and existential quantification in rule heads and is therefore an attractive language for knowledge representation and reasoning, especially in domains where ontology-based reasoning is needed. We formally define syntax and semantics of the language Datalog∃,˅, and provide a notion of instantiation, which we prove to be adequate for Datalog∃,˅. A main issue of Datalog∃ and hence also of Datalog∃,˅ is that decidability is no longer guaranteed for typical reasoning tasks. In order to address this issue, we identify many decidable fragments of the language, which extend, in a natural way, analog classes defined in the non-disjunctive case. Moreover, we carry out an in-depth complexity analysis, deriving interesting results which range from Logarithmic Space to Exponential Time.
APA, Harvard, Vancouver, ISO, and other styles
9

Kaminski, Mark, Yavor Nenov, and Bernardo Cuenca Grau. "Datalog rewritability of Disjunctive Datalog programs and non-Horn ontologies." Artificial Intelligence 236 (July 2016): 90–118. http://dx.doi.org/10.1016/j.artint.2016.03.006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

NOTTELMANN, HENRIK, and NORBERT FUHR. "ADDING PROBABILITIES AND RULES TO OWL LITE SUBSETS BASED ON PROBABILISTIC DATALOG." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 14, no. 01 (February 2006): 17–41. http://dx.doi.org/10.1142/s0218488506003819.

Full text
Abstract:
This paper proposes two probabilistic extensions of variants of the OWL Lite description language, which are essential for advanced applications like information retrieval. The first step follows the axiomatic approach of combining description logics and Horn clauses: Subsets of OWL Lite are mapped in a sound and complete way onto Horn predicate logics (Datalog variants). Compared to earlier approaches, a larger fraction of OWL Lite can be transformed by switching to Datalog with equality in the head; however, some OWL Lite constructs cannot be transformed completely into Datalog. By using probabilistic Datalog, the new probabilistic OWL Lite subsets (both with support for Horn rules) are defined, and the semantics are given by the semantics of the corresponding probabilistic Datalog program. As inference engines for probabilistic Datalog are available, description logics and information retrieval systems can easily be combined.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Datamol"

1

Stüber, Torsten. "Multioperator Weighted Monadic Datalog." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2011. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-68116.

Full text
Abstract:
In this thesis we will introduce multioperator weighted monadic datalog (mwmd), a formal model for specifying tree series, tree transformations, and tree languages. This model combines aspects of multioperator weighted tree automata (wmta), weighted monadic datalog (wmd), and monadic datalog tree transducers (mdtt). In order to develop a rich theory we will define multiple versions of semantics for mwmd and compare their expressiveness. We will study normal forms and decidability results of mwmd and show (by employing particular semantic domains) that the theory of mwmd subsumes the theory of both wmd and mdtt. We conclude this thesis by showing that mwmd even contain wmta as a syntactic subclass and present results concerning this subclass.
APA, Harvard, Vancouver, ISO, and other styles
2

Schwandtner, Goetz. "Datalog on infinite structures." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2008. http://dx.doi.org/10.18452/15836.

Full text
Abstract:
Datalog ist die relationale Variante der logischen Programmierung und ist eine Standard-Abfragesprache in der Datenbankentheorie geworden. Die Programmkomplexität von Datalog im bisherigen Hauptanwendungsgebiet, auf endlichen Strukturen, ist bekanntermassen in EXPTIME. Wir untersuchen die Komplexität von Datalog auf unendlichen Strukturen, motiviert durch mögliche Anwendungen von Datalog auf unendlichen Strukturen (z.B. linearen Ordnungen) im zeitlichen und räumlichen Schliessen, aber auch durch das aufkommende Interesse an unendlichen Strukturen bei verwandten theoretischen Problemen, wie Constraint Satisfaction Problems (CSP): Im Gegensatz zu endlichen Strukturen können Datalog-Berechnungen auf unendlichen Strukturen unendlich lange dauern, was zur Unentscheidbarkeit von Datalog auf unendlichen Strukturen führen kann. Aber auch in den entscheidbaren Fällen kann die Komplexität von Datalog auf unendlichen Strukturen beliebig hoch sein. Im Hinblick auf dieses Ergebnis widmen wir uns dann unendlichen Strukturen mit der niedrigsten Komplexität von Datalog: Wir zeigen, dass Datalog auf linearen Ordnungen (auch dichte und diskrete, mit oder ohne Konstanten und sogar gefärbte) und Baumordnungen EXPTIME-vollständig ist. Für die Bestimmung der oberen Schranke werden Werkzeuge für Datalog auf Ordnungen eingeführt: Ordnungstypen, Abstandstypen und typdisjunkte Programme. Die Typkonzepte liefern eine endliche Beschreibung der unendlichen Programmergebnisse und könnten auch für praktische Anwendungen von Interesse sein. Wir erzeugen spezielle typdisjunkte Programme, die sich ohne Rekursion lösen lassen. Ein Transfer unserer Methoden auf CSPs zeigt, dass CSPs auf unendlichen Strukturen mit beliebig hoher Zeitkomplexität vorkommen, wie Datalog.
Datalog is the relational variant of logic programming and has become a standard query language in database theory. The (program) complexity of datalog in its main context so far, on finite databases, is well known to be in EXPTIME. We research the complexity of datalog on infinite databases, motivated by possible applications of datalog to infinite structures (e.g. linear orders) in temporal and spatial reasoning on one hand and the upcoming interest in infinite structures in problems related to datalog, like constraint satisfaction problems: Unlike datalog on finite databases, on infinite structures the computations may take infinitely long, leading to the undecidability of datalog on some infinite structures. But even in the decidable cases datalog on infinite structures may have arbitrarily high complexity, and because of this result, we research some structures with the lowest complexity of datalog on infinite structures: Datalog on linear orders (also dense or discrete, with and without constants, even colored) and tree orders has EXPTIME-complete complexity. To achieve the upper bound on these structures, we introduce a tool set specialized for datalog on orders: Order types, distance types and type disjoint programs. The type concept yields a finite representation of the infinite program results, which could also be of interest for practical applications. We create special type disjoint versions of the programs allowing to solve datalog without the recursion inherent in each datalog program. A transfer of our methods shows that constraint satisfaction problems on infinite structures occur with arbitrarily high time complexity, like datalog.
APA, Harvard, Vancouver, ISO, and other styles
3

Hajiyev, Elnar. "Datalog as a pointcut language." Thesis, University of Oxford, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.496905.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Chen, Liming. "Extension du langage logique datalog." Paris 6, 1989. http://www.theses.fr/1989PA066099.

Full text
Abstract:
La premiere extension proposee, notee datalog+adt, integre dans datalog les fonctions, sous forme de types abstraits de donnees, qui sont decrits par des systemes de reecriture de termes. La deuxieme extension, notee datalog+agreg, consiste a integrer les fonctions d'agregats dans datalog. Une semantique canonique est definie a l'aide des techniques de stratification et du point fixe. Enfin, une restriction de langage datalog+agreg est proposee
APA, Harvard, Vancouver, ISO, and other styles
5

Grumbach, Stéphane. "Ensembles et fonctions en Datalog." Paris 11, 1990. http://www.theses.fr/1990PA112003.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wassell, Mark P. "Semantic optimisation in datalog programs." Master's thesis, University of Cape Town, 1990. http://hdl.handle.net/11427/13556.

Full text
Abstract:
Bibliography: leaves 138-142.
Datalog is the fusion of Prolog and Database technologies aimed at producing an efficient, logic-based, declarative language for databases. This fusion takes the best of logic programming for the syntax of Datalog, and the best of database systems for the operational part of Datalog. As is the case with all declarative languages, optimisation is necessary to improve the efficiency of programs. Semantic optimisation uses meta-knowledge describing the data in the database to optimise queries and rules, aiming to reduce the resources required to answer queries. In this thesis, I analyse prior work that has been done on semantic optimisation and then propose an optimisation system for Datalog that includes optimisation of recursive programs and a semantic knowledge management module. A language, DatalogiC, which is an extension of Datalog that allows semantic knowledge to be expressed, has also been devised as an implementation vehicle. Finally, empirical results concerning the benefits of semantic optimisation are reported.
APA, Harvard, Vancouver, ISO, and other styles
7

Lifschitz, Sérgio. "Stratégies d'évaluation parallèle de requêtes Datalog récursives /." Paris : Ecole nationale supérieure des télécommunications, 1994. http://catalogue.bnf.fr/ark:/12148/cb357262340.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Szabó, Tamás [Verfasser]. "Incrementalizing Static Analyses in Datalog / Tamás Szabó." Mainz : Universitätsbibliothek der Johannes Gutenberg-Universität Mainz, 2021. http://d-nb.info/1227578350/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Azambuja, Fábio Melo de. "A problemática do cheque pós-datado." Pontifícia Universidade Católica do Rio Grande do Sul, 2007. http://hdl.handle.net/10923/2535.

Full text
Abstract:
Made available in DSpace on 2013-08-07T18:48:39Z (GMT). No. of bitstreams: 1 000397639-Texto+Parcial-0.pdf: 91565 bytes, checksum: 5d2c8877bf9ab375f20569bd4542ef7b (MD5) Previous issue date: 2007
This thesis studies the posted-dated cheque, its origin, its use by Brazilian society, its legal previsions, tenets and jurisprudence. Considering its growing use and the lack of legal regulation, giving rise to a lack of judicial security, the legal solutions to be found in other countries were analysed. Proposed legislation currently being evaluated by the Federal Chamber and the Senate that seek the regulation of post-dated cheques were also analysed. The thesis arrives at its conclusion demonstrating that the proposed legislation would not alter the structure of the Law of the Cheque, which is fruit of an international agreement, approved by the the National Congress, indicating that the security analysed should emerge as a new security by way of specific legislation.
A presente dissertação versa sobre o cheque pós-datado, a sua origem, a sua utilização pela sociedade brasileira, a sua previsão legal, a doutrina e a jurisprudência sobre o assunto. Considerando-se a sua crescente utilização e a falta de regulamentação legal, ocorre uma insegurança jurídica. Comenta-se, também, a solução legal encontrada por outros países. Analisam-se, ainda, os projetos de lei em tramitação na câmara federal e senado que buscam a regulamentação do cheque pós-datado. A dissertação encerra, demonstrando que os projetos de lei não poderão alterar a estrutura da lei do cheque, pois a referida lei é fruto de acordo internacional aprovado pelo congresso nacional, concluindo que o titulo de credito analisado devera surgir como um novo titulo de credito, através de lei própria.
APA, Harvard, Vancouver, ISO, and other styles
10

Seipel, Dietmar. "Practical Applications of Extended Deductive Databases in DATALOG*." Universität Potsdam, 2010. http://opus.kobv.de/ubp/volltexte/2010/4145/.

Full text
Abstract:
A wide range of additional forward chaining applications could be realized with deductive databases, if their rule formalism, their immediate consequence operator, and their fixpoint iteration process would be more flexible. Deductive databases normally represent knowledge using stratified Datalog programs with default negation. But many practical applications of forward chaining require an extensible set of user–defined built–in predicates. Moreover, they often need function symbols for building complex data structures, and the stratified fixpoint iteration has to be extended by aggregation operations. We present an new language Datalog*, which extends Datalog by stratified meta–predicates (including default negation), function symbols, and user–defined built–in predicates, which are implemented and evaluated top–down in Prolog. All predicates are subject to the same backtracking mechanism. The bottom–up fixpoint iteration can aggregate the derived facts after each iteration based on user–defined Prolog predicates.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Datamol"

1

Zilog. Datacom ICs. Campbell,CA: Zilog, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

de Moor, Oege, Georg Gottlob, Tim Furche, and Andrew Sellers, eds. Datalog Reloaded. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24206-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Schatt, Stanley. Datacom basics. Chicago, IL: Telephony, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Mitcheltree, Tom. Dataman: A mystery. Aurora, CO: Write Way Pub., 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

SGS-Thomson. Datacom products databook. (s.l.): SGS-Thomson, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Rogosa, Morrison. Coding microbiological datafor computers. New York: Springer-Verlag, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

SGS-Thomson. ISDN and datacom products databook. [s.l.]: SGS-Thomson, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Barceló, Pablo, and Reinhard Pichler, eds. Datalog in Academia and Industry. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32925-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Georg, Gottlob, Furche Tim, Sellers Andrew, and SpringerLink (Online service), eds. Datalog Reloaded: First International Workshop, Datalog 2010, Oxford, UK, March 16-19, 2010. Revised Selected Papers. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

American Society of Heating, Refrigerating and Air-Conditioning Engineers. Liquid cooling guidelines for datacom equipment centers. Atlanta, [GA]: ASHRAE, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Datamol"

1

Pichler, Reinhard. "Exploiting Bounded Treewidth with Datalog (A Survey)." In Datalog Reloaded, 88–105. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24206-9_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Alpuente, María, Marco Antonio Feliú, Christophe Joubert, and Alicia Villanueva. "Datalog-Based Program Analysis with BES and RWL." In Datalog Reloaded, 1–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24206-9_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dahl, Veronica. "Informing Datalog through Language Intelligence – A Personal Perspective." In Datalog Reloaded, 161–80. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24206-9_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Eisner, Jason, and Nathaniel W. Filardo. "Dyna: Extending Datalog for Modern AI." In Datalog Reloaded, 181–220. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24206-9_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Magnani, Matteo, and Danilo Montesi. "Datalog for the Web 2.0: The Case of Social Network Data Management." In Datalog Reloaded, 221–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24206-9_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Orsi, Giorgio, and Letizia Tanca. "Context Modelling and Context-Aware Querying." In Datalog Reloaded, 225–44. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24206-9_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Smaragdakis, Yannis, and Martin Bravenboer. "Using Datalog for Fast and Easy Program Analysis." In Datalog Reloaded, 245–51. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24206-9_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Abiteboul, Serge, Meghyn Bienvenu, Alban Galland, and Marie-Christine Rousset. "Distributed Datalog Revisited." In Datalog Reloaded, 252–61. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24206-9_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Alvaro, Peter, William R. Marczak, Neil Conway, Joseph M. Hellerstein, David Maier, and Russell Sears. "Dedalus: Datalog in Time and Space." In Datalog Reloaded, 262–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24206-9_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Alviano, Mario, Wolfgang Faber, Nicola Leone, Simona Perri, Gerald Pfeifer, and Giorgio Terracina. "The Disjunctive Datalog System DLV." In Datalog Reloaded, 282–301. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24206-9_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Datamol"

1

Dura, Alexandru, Hampus Balldin, and Christoph Reichenbach. "MetaDL: analysing Datalog in Datalog." In the 8th ACM SIGPLAN International Workshop. New York, New York, USA: ACM Press, 2019. http://dx.doi.org/10.1145/3315568.3329970.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Dalmau, Victor, and Benoit Larose. "Maltsev + Datalog --≫ Symmetric Datalog." In 2008 23rd Annual IEEE Symposium on Logic in Computer Science (LICS 2008). IEEE, 2008. http://dx.doi.org/10.1109/lics.2008.14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

de Oliveira, Augusto Born, Jean-Christophe Petkovich, Thomas Reidemeister, and Sebastian Fischmeister. "DataMill." In the ACM/SPEC international conference. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2479871.2479892.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Calì, Andrea, Georg Gottlob, and Thomas Lukasiewicz. "Datalog±." In the 12th International Conference. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1514894.1514897.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hellerstein, Joseph M. "Datalog redux." In the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1807085.1807087.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Vianu, Victor. "Datalog Unchained." In SIGMOD/PODS '21: International Conference on Management of Data. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3452021.3458815.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Greco, Gianluigi, Antonella Guzzo, Domenico Saccà, and Francesco Scarcello. "Event choice datalog." In the 6th ACM SIGPLAN international conference. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/1013963.1013989.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sagiv, Y. "Optimizing datalog programs." In the sixth ACM SIGACT-SIGMOD-SIGART symposium. New York, New York, USA: ACM Press, 1987. http://dx.doi.org/10.1145/28659.28696.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Matera, Francesco, and Pierpaolo Boffi. "Photonics for datacom." In 2014 Fotonica AEIT Italian Conference on Photonics Technologies (Fotonica AEIT). IEEE, 2014. http://dx.doi.org/10.1109/fotonica.2014.6843830.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lutz, Carsten, and Leif Sabellek. "Ontology-Mediated Querying with the Description Logic EL: Trichotomy and Linear Datalog Rewritability." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/164.

Full text
Abstract:
We consider ontology-mediated queries (OMQs) based on an EL ontology and an atomic query (AQ), provide an ultimately fine-grained analysis of data complexity and study rewritability into linear Datalog-aiming to capture linear recursion in SQL. Our main results are that every such OMQ is in AC0, NL-complete or PTime-complete, and that containment in NL coincides with rewritability into linear Datalog (whereas containment in AC0 coincides with rewritability into first-order logic). We establish natural characterizations of the three cases, show that deciding linear Datalog rewritability (as well as the mentioned complexities) is ExpTime-complete, give a way to construct linear Datalog rewritings when they exist, and prove that there is no constant bound on the arity of IDB relations in linear Datalog rewritings.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Datamol"

1

Alvaro, Peter, William R. Marczak, Neil Conway, Joseph M. Hellerstein, David Maier, and Russell C. Sears. Dedalus: Datalog in Time and Space. Fort Belvoir, VA: Defense Technical Information Center, December 2009. http://dx.doi.org/10.21236/ada538767.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Imielinski, Tomasz, and B. R. Badrinath. Dataman Project-Information Services for Low-Powered Wireless Mobile Clients. Fort Belvoir, VA: Defense Technical Information Center, March 2001. http://dx.doi.org/10.21236/ada413020.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Datamol' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography