Filters








300,021 Hits in 4.9 sec

EFFICIENT SOLVING OF TIME-DEPENDENT ANSWER SET PROGRAMS

Timur Fayruzov, Jeroen Janssen, Dirk Vermeir, Chris Cornelis, Martine De Cock
2010 the International Conference on Logic Programming   unpublished
Instead of solving these Markovian programs for a long time interval {0,. .. , tmax}, we successively find answer sets of parts of the grounded program.  ...  In this paper we propose a more efficient algorithm for solving Markovian programs, which are time-dependent programs for which the next state depends only on the previous state.  ...  We proposed an efficient algorithm for solving Markovian programs, i.e. time-dependent programs for which the next state of the program depends only on the previous state of the program.  ... 
fatcat:4ykj67yi6vhstnubdwokp6whly

Solving Hard ASP Programs Efficiently [chapter]

Wolfgang Faber, Francesco Ricca
2005 Lecture Notes in Computer Science  
Recent research on answer set programming (ASP) systems, has mainly focused on solving NP problems more efficiently.  ...  The definition of hDS is geared towards the peculiarites of hard programs, while it maintains the benign behaviour of the well-assessed heuristic of DLV for NP problems.  ...  If the program is not tight and stratified, then supported models are not guaranteed to be answer sets; but answer-set checking can be done efficiently if the program is HCF. 1.  ... 
doi:10.1007/11546207_19 fatcat:a7yzzpjrbbgjdnzbatitq27nse

Answer Set Solving exploiting Treewidth and its Limits [article]

Markus Hecher
2019 arXiv   pre-print
In our research, we want to exploit treewidth in the context of Answer Set Programming (ASP), a declarative modeling and solving framework, which has been successfully applied in several application domains  ...  So far, we presented algorithms for ASP for the full ASP-Core-2 syntax, which is competitive especially when it comes to counting answer sets.  ...  Answer Set Programming (ASP) [3] is a logic-based declarative modeling language and problem solving framework where selected models, the answer sets, of a given ASP program directly represent the solutions  ... 
arXiv:1905.01688v1 fatcat:zmhwwfjhnjeudbnqharz7hse6y

Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More [article]

Antonius Weinzierl, Richard Taupe, Gerhard Friedrich
2020 arXiv   pre-print
Answer-Set Programming (ASP) is a powerful and expressive knowledge representation paradigm with a significant number of applications in logic-based AI.  ...  In this work we present, for the first time, adaptions to the lazy-grounding setting for many important techniques, like restarts, phase saving, domain-independent heuristics, and learned-clause deletion  ...  ) under the program "ICT of the Future" between 2017 and 2020, 12 and in the scope of the research project Productive4.0, which is funded by EU-ECSEL under grant agreement no737459.  ... 
arXiv:2008.03526v1 fatcat:2ae6pg2xbrg4xhfd6rs5lv7owq

Modelling gene and protein regulatory networks with Answer Set Programming

Timur Fayruzov, Jeroen Janssen, Dirk Vermeir, Chris Cornelis, Martine De Cock
2011 International Journal of Data Mining and Bioinformatics  
In this paper we propose an answer set programming (ASP) based approach to model interaction networks.  ...  Obtained steady states of these networks correspond to those of the boolean networks.  ...  A Markovian program is an answer set program that satisfies the following condition: every rule with a time-dependent predicate in its head that depends on time T contains only time-dependent predicates  ... 
doi:10.1504/ijdmb.2011.039178 pmid:21544955 fatcat:beo22vcca5gjpbs5nkg2jqdmry

Conflict-driven ASP Solving with External Sources and Program Splits

Christoph Redl
2017 Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence  
Answer Set Programming (ASP) is a well-known problem solving approach based on nonmonotonic reasoning.  ...  To this end, we identify reasons for inconsistency of program components wrt. input from predecessor components and propagate them back.  ...  Efficiency strongly depends on learning additional nogoods during solving, which are only implicitly in the program.  ... 
doi:10.24963/ijcai.2017/172 dblp:conf/ijcai/Redl17 fatcat:p2f6tcso5zge7psbvpx47fhrb4

Integrated Algorithms for HEX-Programs and Applications in Machine Learning [article]

Tobias Kaminski
2019 arXiv   pre-print
This paper summarizes my doctoral research on evaluation algorithms for HEX-programs, which extend Answer Set Programming with means for interfacing external computations.  ...  The focus is on integrating different subprocesses of HEX-evaluation, such as solving and external calls as well as grounding, and on applications of HEX-programs in the area of Machine Learning.  ...  The setting of HEX differs as its goal is to enable a broad range of users to implement custom external sources and to harness efficient solving techniques.  ... 
arXiv:1905.02428v1 fatcat:7ztzs7upefd5re2tdlb4wca56q

Solving Disjunctive Fuzzy Answer Set Programs [chapter]

Mushthofa Mushthofa, Steven Schockaert, Martine De Cock
2015 Lecture Notes in Computer Science  
Fuzzy Answer Set Programming (FASP) is an extension of the popular Answer Set Programming (ASP) paradigm which is tailored for continuous domains.  ...  We then introduce a general method for solving disjunctive FASP programs, which combines the proposed reduction with the use of mixed integer programming for minimality checking.  ...  Let P be any subset of a program P. If I is an answer set of P and it satisfies all the rules in P − P , then I is also an answer set of P. Proof.  ... 
doi:10.1007/978-3-319-23264-5_38 fatcat:ctsq7oizejfblcln2ceywqiwem

DLV MC : Enhanced Model Checking in DLV [chapter]

Marco Maratea, Francesco Ricca, Pierfrancesco Veltri
2010 Lecture Notes in Computer Science  
Stable Model Checking (MC) in Answer Set Programming systems is, in general, a co-NP task for disjunctive programs.  ...  search space during answer set computation.  ...  We thank Nicola Leone for fruitful discussion about the topic of the paper.  ... 
doi:10.1007/978-3-642-15675-5_33 fatcat:jcfqzgqm7zexdeu35p2hijmwu4

Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More

ANTONIUS WEINZIERL, RICHARD TAUPE, GERHARD FRIEDRICH
2020 Theory and Practice of Logic Programming  
AbstractAnswer-Set Programming (ASP) is a powerful and expressive knowledge representation paradigm with a significant number of applications in logic-based AI.  ...  In this work we present, for the first time, adaptions to the lazy-grounding setting for many important techniques, like restarts, phase saving, domain-independent heuristics, and learned-clause deletion  ...  ) under the program "ICT of the Future" between 2017 and 2020, 12 and in the scope of the research project Productive4.0, which is funded by EU-ECSEL under grant agreement no737459.  ... 
doi:10.1017/s1471068420000332 fatcat:cuwf4nybw5anplygblgczv2mai

An Efficient and Flexible Engine for Computing Fixed Points [article]

Hai-Feng Guo, Gopal Gupta
2005 arXiv   pre-print
Experimental results are shown to indicate that the mode declaration improves both time and space performances in solving dynamic programming problems.  ...  Thirdly, the mode-declaration scheme provides a new declarative method for dynamic programming, which is typically used for solving optimization problems.  ...  Ramakrishnan, Bart Demoen, Kostis Sagonas and Neng-Fa Zhou for general discussions about tabled logic programming and to Peter Stuckey for discussion on work presented in this paper.  ... 
arXiv:cs/0412041v2 fatcat:rruqisb2pjcone6va5jmd4jsqy

Computers with closed timelike curves can solve hard problems [article]

Todd A. Brun
2002 arXiv   pre-print
A computer which has access to a closed timelike curve, and can thereby send the results of calculations into its own past, can exploit this to solve difficult computational problems efficiently.  ...  I give a specific demonstration of this for the problem of factoring large numbers, and argue that a similar approach can solve NP-complete and PSPACE-complete problems.  ...  idea is spite of its innate craziness.  ... 
arXiv:gr-qc/0209061v1 fatcat:2hybol2dd5fdjhcjs2624ik7o4

Better Paracoherent Answer Sets with Less Resources

GIOVANNI AMENDOLA, CARMINE DODARO, FRANCESCO RICCA
2019 Theory and Practice of Logic Programming  
AbstractAnswer Set Programming (ASP) is a well-established formalism for logic programming. Problem solving in ASP requires to write an ASP program whose answers sets correspond to solutions.  ...  Paracoherent answer set semantics extend the classical semantics of ASP to draw meaningful conclusions also from incoherent programs, with the result of increasing the range of applications of ASP.  ...  Proposition 2 Given a program P , detecting a cycle in the dependency graph of P having an odd number of negated arcs, can be done in linear time with respect to |E P |.  ... 
doi:10.1017/s1471068419000176 fatcat:rw62xqx2fnfqjnj76i4l4oiflq

Partial Compilation of ASP Programs

BERNARDO CUTERI, CARMINE DODARO, FRANCESCO RICCA, PETER SCHÜLLER
2019 Theory and Practice of Logic Programming  
AbstractAnswer Set Programming (ASP) is a well-known declarative formalism in logic programming.  ...  State-of-the-art ASP systems are based on the traditional ground&solve approach and are general-purpose implementations, i.e., they are essentially built once for any kind of input program.  ...  Acknowledgments This work has been partially supported by MIUR under PRIN 2017 project n. 2017M9C25L 001 (CUP H24I17000080001), and from the EU's Horizon 2020 research and innovation program under grant  ... 
doi:10.1017/s1471068419000231 fatcat:lyfcirees5akzb2awyb553jfju

On the Suitability of Programming Tasks for Automated Evaluation

Michal FORISEK
2006 Informatics in Education. An International Journal  
As an example, most of the programming contests use an automatic evaluation of the contestants' submissions. While this approach is clearly highly efficient, it also has some drawbacks.  ...  For many programming tasks we would be glad to have some kind of automatic evaluation process.  ...  A reasonably fast correct program should be able to solve each of these inputs well within the imposed limits. The second set, called the efficiency set, will consist of 20+ inputs of various sizes.  ... 
doaj:d54baeb02e554c8dbe629d974e7ee085 fatcat:w7yggymb5bdjdenfmdvo5mlree
« Previous Showing results 1 — 15 out of 300,021 results