Filters








99 Hits in 3.5 sec

On fast large-scale program analysis in Datalog

Bernhard Scholz, Herbert Jordan, Pavle Subotić, Till Westmann
2016 Proceedings of the 25th International Conference on Compiler Construction - CC 2016  
With Datalog, a designer expresses a static program analysis in the form of a logical specification.  ...  In this work, we introduce a new program synthesis methodology for Datalog specifications to produce highly efficient monolithic C++ analyzers.  ...  Synthesizing from Datalog The second stage synthesizes an imperative program from the declarative Datalog program represented as an AST using a step-bystep relational description of the input program.  ... 
doi:10.1145/2892208.2892226 dblp:conf/cc/ScholzJSW16 fatcat:gr3nqkh7a5ennbgxrrpyncb74i

A Practical Dynamic Programming Approach to Datalog Provenance Computation [article]

Yann Ramusat and Silviu Maniu and Pierre Senellart
2021 arXiv   pre-print
We establish a translation between a formalism for dynamic programming over hypergraphs and the computation of semiring-based provenance for Datalog programs.  ...  Theoretical and practical optimizations lead to an efficient implementation using Soufflé, a state-of-the-art Datalog interpreter.  ...  Implementation and experiments In numerous application domains, Datalog is used as a domain specific language (DSL) to express logical specifications for static program analysis.  ... 
arXiv:2112.01132v1 fatcat:irvz7s4jjbfonadexvqbpnth54

On the Complexity of Inductively Learning Guarded Rules [article]

Andrei Draghici, Georg Gottlob, Matthias Lanzinger
2021 arXiv   pre-print
We investigate the computational complexity of mining guarded clauses from clausal datasets through the framework of inductive logic programming (ILP).  ...  Provenance-guided synthesis of datalog programs. Proc. ACM Program. Lang. 4, POPL (2020), 62:1-62:27. [20] S , X., R , M., H , K., N , M. Synthesizing datalog programs using numerical relaxation.  ...  Recently, the inductive synthesis of Datalog programs, using a variety of different techniques, has received particular attention [19, 20] .  ... 
arXiv:2110.03624v1 fatcat:qhjretsmqzhvpb2emrh4nxrb6u

Concise finite-domain representations for PDDL planning tasks

Malte Helmert
2009 Artificial Intelligence  
Thirdly, we perform an efficient relaxed reachability analysis using logic programming techniques to obtain a grounded representation of the input.  ...  Secondly, we synthesize invariants of the planning task that identify groups of mutually exclusive propositions which can be represented by a single finite-domain variable.  ...  of Datalog programs.  ... 
doi:10.1016/j.artint.2008.10.013 fatcat:b4brha64tre65n6qdb22yqis3u

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  
A typical library is used by client programs through an application programming interface (API) that hides its internals from the client.  ...  We propose a methodology for learning interface specifications using Inductive Logic Programming (ILP).  ...  Inductive Logic Programming. Inductive Logic Programming is a commonly used relational data-mining technique that seeks to infer Prolog/Datalog programs from relational data.  ... 
doi:10.1145/1368088.1368107 dblp:conf/icse/SankaranarayananIG08 fatcat:l6snxfyu6felbfkwqjc676ywum

Logic and Learning (Dagstuhl Seminar 19361)

Michael Benedikt, Kristian Kersting, Phokion G. Kolaitis, Daniel Neider, Michael Wagner
2020 Dagstuhl Reports  
methodologies → Artificial intelligence, Computing methodologies → Machine learning approaches, Computing methodologies → Logical and relational learning, Theory of computation → Constraint and logic programming  ...  bear the advantages of both research methodologies; (ii) review and analyse the progress made across both communities; (iii) understand the subtleties and difficulties involved in solving hard problems using  ...  communities of logic and learning to interact with each other, and we noted from the seminar that researchers from each community appreciated the perspective offered by the other, often identified techniques used  ... 
doi:10.4230/dagrep.9.9.1 dblp:journals/dagstuhl-reports/BenediktKKN19 fatcat:rwjks5mydzhctlvedtel3vtzoy

From Statistical Relational to Neuro-Symbolic Artificial Intelligence [article]

Luc De Raedt, Sebastijan Dumančić, Robin Manhaeve, Giuseppe Marra
2020 arXiv   pre-print
These cannot only be used to characterize and position neuro-symbolic artificial intelligence approaches but also to identify a number of directions for further research.  ...  This is relevant especially for those approaches to neurosymbolic computation that are used to synthesize programs from examples.  ...  If the entity has inherent numerical properties, these could be used as sub-symbols (e.g. the pixel data of an image).  ... 
arXiv:2003.08316v2 fatcat:tlgua7bvyvbftcnlngn7drix34

Predicting Strategic Behavior from Free Text (Extended Abstract)

Omer Ben-Porat, Lital Kuchy, Sharon Hirsch, Guy Elad, Roi Reichart, Moshe Tennenholtz
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
This is relevant especially for those approaches to neural-symbolic computation that are used to synthesize programs from examples.  ...  The first type of rule forms the basis of programming and database languages such as Prolog and Datalog. It is typically used for forward or backward inference to prove that certain atoms hold.  ... 
doi:10.24963/ijcai.2020/688 dblp:conf/ijcai/RaedtDMM20 fatcat:kbp4p2slsrculnqg2ig2dvchde

On the verification of security-aware E-services

Silvio Ranise
2012 Journal of symbolic computation  
So, techniques for the specification and automated analysis of web services to be used in security-sensitive applications are crucial in the development of these systems.  ...  We investigate the decidability of relevant verification problems such as goal reachability (for the validation of use-case scenarios) and log validation (for detecting frauds) and provide sufficient conditions  ...  (The semantics of Ω is the standard one for constraint semi-positive Datalog programs, see, e.g., Toman (1997) .)  ... 
doi:10.1016/j.jsc.2011.12.033 fatcat:mysxkoynjjcstgvwk7kdjmh7ui

Making sense of raw input

Richard Evans, Matko Bošnjak, Lars Buesing, Kevin Ellis, David Pfau, Pushmeet Kohli, Marek Sergot
2021 Artificial Intelligence  
Thus, the system jointly synthesizes an explanatory symbolic theory, connected to a learned, sub-symbolic perceptual front-end.  ...  Next, we use a neural network to map raw sensory input to disjunctive input.  ...  in the length of the Datalog ⊃ − program we are synthesising.  ... 
doi:10.1016/j.artint.2021.103521 fatcat:lrnnltqicza3rguud5einblafu

SAT-solving approaches to context-aware enterprise network security management

John Homer, Xinming Ou
2009 IEEE Journal on Selected Areas in Communications  
Let us suppose that the user decides that the security of the system is more important, and chooses to relax the γ 1 constraint.  ...  Preliminary experimental results on both realistic and synthesized enterprise network settings indicate that the SAT solving approach is effective and scalable. VIII.  ... 
doi:10.1109/jsac.2009.090407 fatcat:tcbdthot3jafbbhzhwjg3du5na

The Effectiveness of a Balance Training Intervention in Reducing the Incidence of Noncontact Ankle Sprains in High School Football Players

Malachy P. McHugh, Timothy F. Tyler, Michael R. Mirabella, Michael J. Mullaney, Stephen J. Nicholas
2007 American Journal of Sports Medicine  
Let us suppose that the user decides that the security of the system is more important, and chooses to relax the γ 1 constraint.  ...  Preliminary experimental results on both realistic and synthesized enterprise network settings indicate that the SAT solving approach is effective and scalable. VIII.  ... 
doi:10.1177/0363546507300059 pmid:17395956 fatcat:qzylnvlxsbebjb4vehvlvrq2te

Automatic finite unfolding using well-founded measures

Bern Martens, Danny De Schreye
1996 The Journal of Logic Programming  
t> We elaborate on earlier work proposing general criteria to control unfolding during partial deduction of logic programs.  ...  We emphasize the development of fully automatic algorithms for finite unfolding, avoiding the use of ad hoc techniques.  ...  One possible solution can be identifying datalog predicates in a program.  ... 
doi:10.1016/0743-1066(95)00149-2 fatcat:wyub3vqhmbhszmamtvj3gq7ug4

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

Junaid Qadir, Osman Hasan
2015 IEEE Communications Surveys and Tutorials  
Datalog is a declarative logic programming language used as a query language for deductive databases.  ...  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

Pointer Data Structure Synthesis from Answer Set Programming Specifications [article]

Sarat Chandra Varanasi, Neeraj Mittal, Gopal Gupta
2020 arXiv   pre-print
We develop an inductive proof-technique to generate imperative programs for pointer data structures from behavioural specifications expressed in the Answer Set Programming (ASP) formalism.  ...  This work is in the realm of constructing programs that are correct according to a given specification.  ...  For first order logic programs, the programs are assumed to be Datalog programs [6] with variables ranging over finite domains.  ... 
arXiv:2006.07440v2 fatcat:zq6fv2dwbzalnhqsr4luksz5ca
« Previous Showing results 1 — 15 out of 99 results