Filters








33 Hits in 3.7 sec

New DLV Features for Data Integration [chapter]

Francesco Calimeri, Manuela Citrigno, Chiara Cumbo, Wolfgang Faber, Nicola Leone, Simona Perri, Gerald Pfeifer
2004 Lecture Notes in Computer Science  
The DLV system is currently employed in projects on data integration -a challenging application area for Answer Set Programming.  ...  The present system description illustrates some new optimization techniques, which significantly enhance the general performance of DLV, and especially in the context of data integration.  ...  (ii) Backjumping techniques for the program instantiation [11] .  ... 
doi:10.1007/978-3-540-30227-8_60 fatcat:p2qfoonmoncvlfp5elvybqjrzu

The Disjunctive Datalog System DLV [chapter]

Mario Alviano, Wolfgang Faber, Nicola Leone, Simona Perri, Gerald Pfeifer, Giorgio Terracina
2011 Lecture Notes in Computer Science  
The system provides database connectivity offering a simple way for powerful reasoning on top of relational databases. In this paper, we provide an ample overview of the DLV system.  ...  We then focus on DLV DB , an extension of the basic system which allows for tight coupling with traditional database systems. Finally, we report on a number industrial applications which rely on DLV.  ...  In addition, the rule instantiation procedure of DLV implements a BackJumping algorithm [31] which exploits both semantic and structural information about the rule for computing efficiently only a relevant  ... 
doi:10.1007/978-3-642-24206-9_17 fatcat:taece6gunzajbiwksvdygfszg4

Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers

Marco Maratea, Francesco Ricca, Wolfgang Faber, Nicola Leone
2008 Journal of Algorithms  
DLV is the state-of-the-art system for evaluating disjunctive answer set programs.  ...  Recently, DLV has been enhanced with backjumping techniques, which also involve a reason calculus, recording causes for the truth or falsity of atoms during the search.  ...  We would like to thank the anonymous reviewers for their useful suggestions.  ... 
doi:10.1016/j.jalgor.2008.02.006 fatcat:ydr5g4mebrcnjbjck73kph2ulq

Evaluation Techniques and Systems for Answer Set Programming: a Survey

Martin Gebser, Nicola Leone, Marco Maratea, Simona Perri, Francesco Ricca, Torsten Schaub
2018 Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence  
In this paper we trace the history of ASP systems, describing the key evaluation techniques and their implementation in actual tools.  ...  The success of ASP is due to the combination of two factors: a rich modeling language and the availability of efficient ASP implementations.  ...  In particular, the parallel version of the DLV grounder allows for a concurrent instantiation at several levels: it allows for instantiating in parallel subprograms of the program in input, rules within  ... 
doi:10.24963/ijcai.2018/769 dblp:conf/ijcai/GebserLMPRS18 fatcat:g5iryltonjegveigyx4mobuzua

Answer Set Programming [chapter]

Piero Bonatti, Francesco Calimeri, Nicola Leone, Francesco Ricca
2010 Lecture Notes in Computer Science  
ASP has been the subject of intensive research studies, and, also thanks to the availability of some efficient ASP systems, has recently gained quite some popularity and is applied also in relevant industrial  ...  The Italian logic programming community has been very active in this area, some ASP results achieved in Italy are widely recognized as milestones on the road to the current state of the art.  ...  Some year later, in [69] a new backjumping technique for the instantiation of a rule has been proposed which allows for reducing both the size of the generated grounding and the time needed for producing  ... 
doi:10.1007/978-3-642-14309-0_8 fatcat:m7vjxp43qfbgjpujf7ozr72x5q

The Intelligent Grounder of DLV [chapter]

Wolfgang Faber, Nicola Leone, Simona Perri
2012 Lecture Notes in Computer Science  
In this work, we give an overview of the DLV Intelligent Grounder, one of the most popular Answer Set Programming instantiators, and a very strong point of the DLV system.  ...  Based on a variant of semi-naive evaluation, it also includes several advanced optimization techniques and supports a number of application-oriented features which allow for the successful exploitation  ...  For optimizing the rule instantiation task, a backjumping algorithm [34] is employed.  ... 
doi:10.1007/978-3-642-30743-0_17 fatcat:2zehhw5upbbgblazwlbqtg7igi

Answer Set Programming: A Declarative Approach to Solving Challenging Search Problems

Ilkka Niemelä
2011 2011 41st IEEE International Symposium on Multiple-Valued Logic  
rules for rules Support for cardinality and weight constraints and optimization built-in SAT and ASP Grounders: dlv http:  ...  techniques, conflict driven learning, backjumping, restarting, . . .  ...  . % Minimize the number of classB papers minimize [ assignedB(P,R):paper(P):reviewer(R) ]. Part IV ASP Solver Technology Part V Systems, Applications, Literature  ... 
doi:10.1109/ismvl.2011.61 dblp:conf/ismvl/Niemela11 fatcat:evdlcs7bobg6dp25oovr6egv5a

Systems, Engineering Environments, and Competitions

Yuliya Lierler, Marco Maratea, Francesco Ricca
2016 The AI Magazine  
Last, we present the evolution of the answer set programming competitions, prime venues for tracking advances in answer set solving technology.  ...  The goal of this article is threefold. First, we trace the history of the development of answer set solvers, by accounting for more than a dozen of them.  ...  In particular, parallel techniques for the instantiation of programs were proposed as extensions of the Lparse (Pontelli, Balduccini, and Bermudez 2003) and DLV (Perri, Ricca, and Sirianni 2013) grounders  ... 
doi:10.1609/aimag.v37i3.2675 fatcat:huqvzr4nxfdpficyxbnjiknuze

Grounding and Solving in Answer Set Programming

Benjamin Kaufmann, Nicola Leone, Simona Perri, Torsten Schaub
2016 The AI Magazine  
While the former is described by Gebser and Schaub (2016), we focus here on key issues in grounding, or how to systematically replace object variables by ground terms in a effective way, and solving, or  ...  how to compute the answer sets of a propositional logic program obtained by grounding.  ...  Acknowledgments The first and last author were partially funded by DFG grants SCHA 550/8 and SCHA 550/9.  ... 
doi:10.1609/aimag.v37i3.2672 fatcat:zofkizqfwfgmdc3pn7mupxoore

The Sixth Answer Set Programming Competition

Martin Gebser, Marco Maratea, Francesco Ricca
2017 The Journal of Artificial Intelligence Research  
are given more time for solving hard benchmarks.  ...  On the other hand, it featured also some novelties, like a benchmark selection stage classifying instances according to their empirical hardness, and a "Marathon" track where the top-performing systems  ...  Grounding Techniques While virtually all ASP systems rely on a grounding step (cf. Section 2.4), merely the DLV grounder and GRINGO support the instantiation of ASP-Core-2 programs.  ... 
doi:10.1613/jair.5373 fatcat:pjgjrinsc5a2xk4trq6sp22r2u

Disjunctive answer set solvers via templates

REMI BROCHENIN, MARCO MARATEA, YULIYA LIERLER
2015 Theory and Practice of Logic Programming  
In this light, we introduce a general template, which accounts for major techniques implemented in disjunctive solvers.  ...  Transition systems give a unifying perspective and bring clarity in the description and comparison of solvers.  ...  Yet, it does not account for backjumping and learning techniques, implemented in cmodels.  ... 
doi:10.1017/s1471068415000411 fatcat:t3okg2ayvfgslljjmtrlhq5oqa

Logic Programming Applications: What Are the Abstractions and Implementations? [article]

Yanhong A. Liu
2018 arXiv   pre-print
The three key abstractions are join, recursion, and constraint. Their essential implementations are for-loops, fixed points, and backtracking, respectively.  ...  We also discuss language extensions and programming paradigms, summarize example application problems by application areas, and touch on example systems that support variants of the abstractions with different  ...  The constraints are expressed using rules with disjunction in the conclusion, general negation, and aggregates. The DLV system uses backtracking and a suite of efficient implementation techniques.  ... 
arXiv:1802.07284v1 fatcat:6s2ky2rtufceplv3mnsbutq3d4

ASPeRiX, a First Order Forward Chaining Approach for Answer Set Computing [article]

Claire Lefèvre, Christopher Béatrix, Igor Stéphan, Laurent Garcia
2016 arXiv   pre-print
This project was amongst the first to introduce an approach of answer set computing that escapes the preliminary phase of rule instantiation by integrating it in the search process.  ...  Until today, almost all ASP systems apply this two steps computation. In this article, the project ASPeRiX is presented as a first order forward chaining approach for Answer Set Computing.  ...  The problem is very easy for Clingo and DLV but very hard for ASPeRiX and GASP. Systems using grounding on the fly have to repeat instantiation of the same rules in each branch of the search tree.  ... 
arXiv:1503.07717v2 fatcat:howtxly2tjanbkccufcqdl3eii

Answer Set Programming with Clause Learning [chapter]

Jeffrey Ward, John S. Schlipf
2003 Lecture Notes in Computer Science  
We describe how we have adapted conflict clause techniques for use in the answer set solver Smodels. We experimentally compare the resulting program to the original Smodels program.  ...  The use of such clauses has been very important in improving the efficiency of satisfiability (SAT) solvers over the past few years, especially on structured problems coming from applications.  ...  If all the subgoals in a rule Contraposition for true heads.  ... 
doi:10.1007/978-3-540-24609-1_26 fatcat:hezzo7axdvbyjm47xzxsvqtkqa

Shared aggregate sets in answer set programming

MARIO ALVIANO, CARMINE DODARO, MARCO MARATEA
2018 Theory and Practice of Logic Programming  
This paper introduces new data structures and techniques to handle such cases, and more in general aggregations on the same aggregate set identified in the ground program in input.  ...  When the aggregation involves literals whose truth value is undefined at instantiation time, modern grounders introduce several instances of the aggregate, one for each possible interpretation of the undefined  ...  The computation of reasons was supported in some version of DLV, but only for backjumping rather than for constraint learning ; moreover, in DLV reasons are computed as soon as a literal is inferred, rather  ... 
doi:10.1017/s1471068418000133 fatcat:5kazskjgdbguzl5rxbk2ook3tq
« Previous Showing results 1 — 15 out of 33 results