Filters








417 Hits in 1.9 sec

A Modular Logic Approach for Expressing Web Services in XML Applying Dynamic Rules in XML

Theodoros MITAKOS, Ioannis ALMALIOTIS
2009 Informatică economică  
It allows the enrichment of web ontologies by adding definitions of derived concepts and it enhances interoperability among different systems and tools by publishing rules in an XML format.  ...  Moreover the in-creasing demand for interfaces that enhance information sharing has given rise to XML doc-uments that include embedded calls to web services.  ...  We intend to extend our research on Ru-leML-U and enrich it with features such as object identity, inheritance and information hiding giving an object oriented flavor to this deductive language.  ... 
doaj:da70e18a73714b2395ccb5730ac69df0 fatcat:tzmpocnf5re2hpcbbesnp7rcju

Context-sensitive program analysis as database queries

Monica S. Lam, John Whaley, V. Benjamin Livshits, Michael C. Martin, Dzintars Avots, Michael Carbin, Christopher Unkel
2005 Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '05  
In this framework, all program information is stored as relations; data access and analyses are written as Datalog queries.  ...  In particular, context-sensitive pointer alias information is a prerequisite for any sound and precise analysis that reasons about uses of heap objects in a program.  ...  The complexity of implementation we wish to hide is the optimization of BDD operations.  ... 
doi:10.1145/1065167.1065169 dblp:conf/pods/LamWLMACU05 fatcat:awxd54skzna25ajuh66aeusrci

Generalized Earley Deduction and its Correctness [chapter]

Clemens Beckstein, Michelle Kim
1991 GWAI-91 15. Fachtagung für Künstliche Intelligenz  
This paper describes a deduction method that works both top-down and bottom-up. The method can be viewed as an extension of a well-known approach|Earley deduction|to handle negation-as-failure.  ...  We argue by means of examples that these dependencies allow the method to avoid some redundant deductions, and that they are useful in forward reasoning in the presence of negation-as-failure.  ...  Acknowledgements The authors are indebted to Adrian Walker and Franciso Corella for their many valuable suggestions. We also thank B. Grosof, L. Morgenstern, and P.  ... 
doi:10.1007/978-3-662-02711-0_1 dblp:conf/ki/BecksteinK91 fatcat:o7mayvnu5rf47nwev6fruwcvva

Datalogging instrument arrays: Powerful yet inexpensive tools for recording the heterogeneous physical environment of coral reefs

Steven W Moore
1999 Oceanologica Acta  
Suitable instruments are already commercially available for $100 (US) or less per unit, and more are being produced.  ...  Recent advances in semiconductor electronics technology have made it easier and much less expensive to build small and reliable (datalogging instruments, which can be deployed in arrays 'to record spatio-temporal  ...  OVERVIEW OF A TYPICAL DATALOGGING INSTRUMENT A typical datalogging instrument includes one or more sensors fieeding information to a datalogger (fisure 2).  ... 
doi:10.1016/s0399-1784(00)88959-8 fatcat:dti6aaaqc5csjpcj4hauir6bsm

Semantic Web and Peer-to-Peer Technologies for Distributed Learning Repositories [chapter]

Wolfgang Nejdl
2002 IFIP Advances in Information and Communication Technology  
0-Telos-Peer with native Datalog query and inference capabilities.  ...  and annotation.  ...  This paper discusses and sketches the Edutella infrastructure and necessary technologies for this network in more detail as weIl as two application areas (digitallibraries and smart leaming spaces), developed  ... 
doi:10.1007/978-0-387-35602-0_5 fatcat:qky3sfhlyfh7vdvpv25aiays34

Mining library specifications using inductive logic programming

Sriram Sankaranarayanan, Franjo Ivanči, Aarti Gupta
2008 Proceedings of the 13th international conference on Software engineering - ICSE '08  
Typically, the rules governing the correct usage of the API are documented informally. In many cases, libraries may have complex API usage rules and unclear documentation.  ...  Our technique runs several unit tests on the library in order to generate relations describing the operation of the library.  ...  The comparison yields useful information about bugs, code coverage and so on.  ... 
doi:10.1145/1368088.1368107 dblp:conf/icse/SankaranarayananIG08 fatcat:l6snxfyu6felbfkwqjc676ywum

Strictly declarative specification of sophisticated points-to analyses

Martin Bravenboer, Yannis Smaragdakis
2009 SIGPLAN notices  
Datalog programs.  ...  We carry the declarative approach further than past work by describing the full end-to-end analysis in Datalog and optimizing aggressively using a novel technique specifically targeting highly recursive  ...  help and support.  ... 
doi:10.1145/1639949.1640108 fatcat:py2qetnvifekndfjzoe52j554y

Strictly declarative specification of sophisticated points-to analyses

Martin Bravenboer, Yannis Smaragdakis
2009 Proceeding of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications - OOPSLA 09  
Datalog programs.  ...  We carry the declarative approach further than past work by describing the full end-to-end analysis in Datalog and optimizing aggressively using a novel technique specifically targeting highly recursive  ...  help and support.  ... 
doi:10.1145/1640089.1640108 dblp:conf/oopsla/BravenboerS09 fatcat:gdpo46vhcrckdirazq6ooh5hyi

PrPl

Seok-Won Seong, Jiwon Seo, Matthew Nasielski, Debangsu Sengupta, Sudheendra Hangal, Seng Keat Teh, Ruven Chu, Ben Dodson, Monica S. Lam
2010 Proceedings of the 1st ACM Workshop on Mobile Cloud Computing & Services Social Networks and Beyond - MCS '10  
We have developed a prototype of the PrPl infrastructure and implemented a number of simple social applications on the system.  ...  We have developed a language called SociaLite, based on Datalog, that allows developers to use a simple declarative database query to access the large collection of private data served up by the Butlers  ...  Blobs may be distributed across remote data stores and possibly encrypted. A unit of data in the system is known as a resource.  ... 
doi:10.1145/1810931.1810939 fatcat:dm6qh3xum5dcjpaijvjuzytd2u

Experience report: Using tools and domain expertise to remediate architectural violations in the LogicBlox software base

R. E. K. Stirewalt, Spencer Rugaber, Hwa-You Hsu, David Zook
2009 2009 31st International Conference on Software Engineering - Companion Volume  
We used DSM-based analysis in conjunction with a suite of code analysis tools to identify and effect large refactorings.  ...  We contribute a process for refactoring that includes the generation of proto-interfaces and the explicit inclusion of expert review.  ...  compile, analyze, and optimize Datalog programs.  ... 
doi:10.1109/icse-companion.2009.5070964 dblp:conf/icse/StirewaltRHZ09 fatcat:3k2oyl6ozff4japw3pmmaqyvty

Metamodelling with Datalog and Classes: ConceptBase at the Age of 21 [chapter]

Matthias Jarke, Manfred A. Jeusfeld, Hans W. Nissen, Christoph Quix, Martin Staudt
2010 Lecture Notes in Computer Science  
management, model management, eLearning, cultural information systems, and data warehousing.  ...  the implementation of XML databases and ontology-based reasoning and data management engines.  ...  Both of them hide the object identifiers to the user and only work with the labels.  ... 
doi:10.1007/978-3-642-14681-7_6 fatcat:n33me2mmxrbilh44a7qtbzz2hi

Pointer Analysis

Yannis Smaragdakis, George Balatsouras
2015 Foundations and Trends® in Programming Languages  
Acknowledgments We thank Martin Bravenboer who originated the development of several declarative analysis concepts and algorithms in the Doop framework, as well as George Kastrinis for Doop contributions  ...  For economy of expression, we introduce forall: syntactic sugar that hides a Datalog pattern for enumerating all members of a set and ensuring that a condition holds universally.  ...  For economy of expression, we introduce forall: syntactic sugar that hides a Datalog pattern for enumerating all members of a set and ensuring that a condition holds universally.  ... 
doi:10.1561/2500000014 fatcat:w5t2rgnl55cqvn6b5krybuid5a

Unit Tests for Ontologies [chapter]

Denny Vrandečić, Aldo Gangemi
2006 Lecture Notes in Computer Science  
As there is no information hiding in ontology engineering, and thus no black box components, at first the idea of unit testing for ontologies seems not applicable.  ...  In this paper we motivate the need for unit testing, describe the adaptation to the unit testing approach, and give use cases and examples.  ...  We want to thank our colleagues for fruitful discussions, especially Stephan Grimm, Boris Motik, Peter Haase, Sudhir Agarwal, Jos Lehmann, and Malvina Nissim.  ... 
doi:10.1007/11915072_2 fatcat:wvd4rp6ov5fqrmyhdd5y6wcrm4

A Model Towards Using Evidence from Security Events for Network Attack Analysis
english

Changwei Liu, Anoop Singhal, Duminda Wijesekera
2014 Proceedings of the 11th International Workshop on Security in Information Systems  
In this paper, we discuss how to use the information obtained from security events to construct an attack scenario and build an evidence graph.  ...  To achieve the accuracy and completeness of the evidence graph, we use Prolog inductive and abductive reasoning to correlate evidence by reasoning the causality, and use an anti-forensics database and  ...  Techniques used to attack data include overwriting stored (meta) data, deleting files or media, hiding information using obfuscation, steganography, encryption or unallocated (slack) spaces, etc.  ... 
doi:10.5220/0004980300830095 dblp:conf/sis/LiuSW14 fatcat:ufwhjmgivfgj7fdehejrakslvy

Reactors: A data-oriented synchronous/asynchronous programming model for distributed applications

John Field, Maria-Cristina Marinescu, Christian Stefansen
2009 Theoretical Computer Science  
Reactor basics A reactor consists of a collection of relations and rules, which together constitute a reactive, atomic, stateful unit of distribution. The full reactor syntax is given in Fig. 1 .  ...  A reactor consists of two principal components: mutable state, in the form of a fixed collection of relations, and code, in the form of a fixed collection of rules in the style of Datalog.  ...  Acknowledgments The authors gratefully acknowledge the contributions of Rafah Hosn, Bruce Lucas, James Rumbaugh, Mark Wegman, and Charles Wiecha to the development of the ideas embodied in this work.  ... 
doi:10.1016/j.tcs.2008.09.052 fatcat:gts74gv6snbhvorstl3mxzjqhi
« Previous Showing results 1 — 15 out of 417 results