Filters








42 Hits in 4.7 sec

CoLab: A hybrid knowledge representation and compilation laboratory

Harold Boley, Philipp Hanschke, Knut Hinkelmann, Manfred Meyer
1995 Annals of Operations Research  
While Horn logic (as implemented in PROLOG) is well-suited for representing relational clauses, other kinds of declarative knowledge call for hybrid extensions: functional dependencies and higher-order  ...  A case study in the realm of mechanical engineering has been an important driving force behind the development of COLAB.  ...  Acknow ledgements The research presented in this paper and the development of COLAB have been carried out by the knowledge-compilation group of the ARC-TEC project at the DFKI, supported by the BMFT under  ... 
doi:10.1007/bf02031716 fatcat:djzxr64dgvce5bdiug7sdfgoca

An Overview of the LDL System

Danette Chimenti, Anthony B. O'Hare, Ravi Krishnamurthy, Shalom Tsur, Carolyn West, Carlo Zaniolo
1987 IEEE Data Engineering Bulletin  
The ultimate aim of the NU-Prolog project is to produce a unified logic/database system, where programs may be expressed declaratively, in a form close to first-order logic, and at the same time efficiently  ...  We describe the current state of the design and implementation of the NU-Prolog Deductive Database system.  ...  We must also thank Jeff Schultz, who implemented the majority of the NU-Prolog system; without his efforts the implementation of the database would have been considerably longer in coming to fruition.  ... 
dblp:journals/debu/ChimentiOKTWZ87 fatcat:ehzmwo32lvd6lntxoyjjm3gsvm

Knowledge Integration

Andreas Maier, Nieves Peña, Iñaki Laresgoiti, Amaia Bernaras
2003 Workshop Ontologie-basiertes Wissensmanagement  
Prolog [Sp96] , Datalog [DL91] , F-Logic [KL90] [An02], Description Logic [Ba02] ) have to be seen complementary to ontologies.  ...  For the last two points we will introduce a rough idea of visualization, not covering all functionalities coming up. 3.1.  ...  By moving them by drag&drop into the fields on the right side (if, then), you would create the rule shown in F-Logic code below. There you could change the rule also by hand.  ... 
dblp:conf/wow/MaierPLB03 fatcat:5ha4jt37fzgrjo3ryvt4wuquni

Declarative Learning-Based Programming as an Interface to AI Systems

Parisa Kordjamshidi, Dan Roth, Kristian Kersting
2022 Frontiers in Artificial Intelligence  
In most cases, machine learning models are the key component of these solutions.  ...  Data-driven approaches are becoming increasingly common as problem-solving tools in many areas of science and technology.  ...  of Datalog.  ... 
doi:10.3389/frai.2022.755361 pmid:35372833 pmcid:PMC8967162 fatcat:7fc4g77knjadlkrwz3crbmd5oq

Aparsen D25.2 - Interoperability Strategies

Yannis Tzitzikas, Yannis Kargakis, Yannis Marketakis, Cristina Lantzaki, Barbara Bazzanella, Simon Lambert, Rene Van Horik, Jeffrey Van Der Hoeven, Emanuele Bellini
2013 Zenodo  
This deliverable analyses the main intelligibility objectives (as identified in D25.1) through a dependency point of view in order to propose a modelling approach that can automate taskperformability checking  ...  In any case we should stress that the methodology presented is general and can be used for extending the modeled tasks, modules, converters and emulators, in order to capture the desired requirements.  ...  In addition, we used this prototype system as a means to specify a number of concrete use cases for the case of DANS.  ... 
doi:10.5281/zenodo.1256518 fatcat:33rzppysq5e5hgcb5ynqgkix3q

BigDataGrapes D4.2 - Methods and Tools for Distributed Inference

Milena Yankova, Boyan SImeonov, Atanas Kiryakov, Vladimir Alexiev
2019 Zenodo  
There are many challenges in data reasoning and inference based on distributed data. The first one is addressing data security and access rights to both original data and inferred information.  ...  The Final section is dedicated to state of the art with a standard theoretical approach to inference from descriptive logic standpoint, as well as related work in implementing those approaches.  ...  The advantage of this scenario is that one can query MongoDB directly having all semantics materialised and will improve query time (see section Evaluation results, where the evaluation setting creates  ... 
doi:10.5281/zenodo.2629568 fatcat:amfv6a5euncnndfhsbgubr4i6q

Planning by Rewriting

J. L. Ambite, C. A. Knoblock
2001 The Journal of Artificial Intelligence Research  
In addition to addressing the issues of planning efficiency and plan quality, this framework offers a new anytime planning algorithm.  ...  The experimental results show that the PbR approach provides significant savings in planning effort while generating high-quality plans.  ...  x ROUGH) (has-hole ?x ?width ?orientation))) Figure 3: Manufacturing Operator rough surface. 7 Note the specification on the resources slot.  ... 
doi:10.1613/jair.754 fatcat:24rw6hh2ovc3dpnd2ki5l4kbpe

Applying Formal Methods to Networking: Theory, Techniques, and Applications

Junaid Qadir, Osman Hasan
2015 IEEE Communications Surveys and Tutorials  
In this paper, we present a self-contained tutorial of the formidable amount of work that has been done in formal methods, and present a survey of its applications to networking.  ...  Despite its great importance, modern network infrastructure is remarkable for the lack of rigor in its engineering.  ...  MulVAL can incorporate bug databases into its framework using Datalog and can perform "what-if" analysis using Prolog programs. G.  ... 
doi:10.1109/comst.2014.2345792 fatcat:oc6l6pn4tnddjbbr5v4gbbuycq

BigDataGrapes D4.2 - Methods and Tools for Distributed Inference

Milena Yankova, Boyan SImeonov, Atanas Kiryakov, Vladimir Alexiev
2020 Zenodo  
There are many challenges in data reasoning and inference based on distributed data. The first one is addressing data security and access rights to both original data and inferred information.  ...  The Final section is dedicated to state of the art with standard theoretical approach to inference from descriptive logic stand point, as well as related work in implementing those approaches.  ...  Datalog is a query and rule language, a simplified version of PROLOG, meant to enable the efficient implementation of deductive databases.  ... 
doi:10.5281/zenodo.4546071 fatcat:qwkhk7crvzgwvfz3dxzaqmy46m

Optimizing Compilation and Computational Complexity of Constraint Handling Rules [chapter]

Jon Sneyers
2009 Lecture Notes in Computer Science  
Computational complexity theory is the study of scalability of computer programs in terms of the computational resources they require -in particular, time (cpu usage) and space (memory usage).  ...  can be implemented in CHR and be executed with the optimal asymptotic time and space complexity.  ...  Also, it should be noted that CHR ∨ subsumes Prolog. have constructed an embedding of a fragment of CHR into an extension of Datalog.  ... 
doi:10.1007/978-3-642-02846-5_41 fatcat:ywwhwcnysbea3alkxbrz7ppfxe

A logic meta-programming foundation for example-driven pattern detection in object-oriented programs

Coen De Roover
2011 2011 27th IEEE International Conference on Software Maintenance (ICSM)  
We have reconciled both approaches by embedding source code excerpts in logic formulas.  ...  They are specified in the concrete syntax of the base program augmented with logic variables.  ...  Johan has been my partner in crime from the moment I was ready to dive into his  ... 
doi:10.1109/icsm.2011.6080830 dblp:conf/icsm/Roover11 fatcat:mtzy44ethrchdmtnkoqjcwiray

SUBSUMER: A PROLOG θ-SUBSUMPTION ENGINE

José Jos´, José Santos, Stephen Muggleton
2010 the International Conference on Logic Programming   unpublished
Crucial to Subsumer's performance is the dynamic and recursive decomposition of a clause in sets of independent components.  ...  Also, since most of those systems are implemented in Prolog, they can immediately take advantage of a Prolog based θ-subsumption engine.  ...  In the once-transformation the clause was transformed and independent literals were embedded in once/1 calls. The transformed clause was then called by the Prolog engine.  ... 
fatcat:7jzotkacojhcrmdhq5fgntelg4

{log}: A language for programming in logic with finite sets

Agostino Dovier, Eugenio G. Omodeo, Enrico Pontelli, Gianfranco Rossi
1996 The Journal of Logic Programming  
A similar solution is shown to be applicable to intensional set-formers, provided either a built-in set collection mechanism or some form of negation in goals and clause bodies is made available.  ...  Predicates E and --designating set membership and equality are included in the base language, along with their negative counterparts ~ and 5.  ...  John Sabini helped us in revising a preliminary version of the manuscript.  ... 
doi:10.1016/0743-1066(95)00147-6 fatcat:modbseh76vfixdevog746xwjgy

Reasoning about Time, Action and Knowledge in Multi-Agent Systems

Ji Ruan
2010 Künstliche Intelligenz  
Datalog Programs Datalog is a query and rule language for deductive databases that, syntactically, is a subset of Prolog [17] . GDL uses Datalog as a basis to specify game rules.  ...  A Datalog Program is a set of Datalog rules. Definition 3.2 (Dependency Graphs for Datalog Programs). Let a Datalog program ∆ be given.  ...  The construction involved the protocol implicitly present in the dynamic epistemic formula, i.e. the set of sequences of actions being executed to evaluate the formula.  ... 
doi:10.1007/s13218-010-0075-6 fatcat:plb3pheairb5bk7uonv7pk3ysi

A domain-specific language for filtering in application-level gateways

Hampus Balldin, Christoph Reichenbach
2020 Proceedings of the 19th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences  
Existing application-level filters express their filtering rules in general-purpose languages, which limits the correctness guarantees available for them.  ...  Application-level packet filtering is a technique for network access control in which an "application-level gateway" intercepts network packets at the application level (e.g., HTTP, FTP), scans them for  ...  Our language is also related to other declarative languages in the tradition of Prolog [25] and Datalog [3] , though we permit updates (similarly to some Datalog dialects [13] ) and offer features  ... 
doi:10.1145/3425898.3426955 fatcat:kfgvwmtuxnek5nn6ohwexfkc5i
« Previous Showing results 1 — 15 out of 42 results