Filters








168,688 Hits in 8.9 sec

A model building framework for answer set programming with external computations

THOMAS EITER, MICHAEL FINK, GIOVAMBATTISTA IANNI, THOMAS KRENNWALLNER, CHRISTOPH REDL, PETER SCHÜLLER
2015 Theory and Practice of Logic Programming  
To cater for this need,hexprograms were designed as a generalization of answer set programs with an API style interface that allows to access arbitrary external sources, providing great flexibility.  ...  We present a new approach for the evaluation of logic programs with external source access, which is based on a configurable framework for dividing the non-ground program into possibly overlapping smaller  ...  Answer Set Building Thanks to the results above, we can obtain the answer sets of a HEX-program from any answer set graph for it. To build an answer set graph, we proceed as follows.  ... 
doi:10.1017/s1471068415000113 fatcat:kq5ya4rvbnhxdd7adsmhyfj32e

ActHEX: Implementing HEX Programs with Action Atoms [chapter]

Michael Fink, Stefano Germano, Giovambattista Ianni, Christoph Redl, Peter Schüller
2013 Lecture Notes in Computer Science  
acthex programs are a convenient tool for connecting stateful external environments to logic programs.  ...  Besides yielding a significant increase in versatility of the framework, we also present illustrative application showcases and a short evaluation thereof exhibiting computational acthex strengths.  ...  P is evaluated using the computational core of dlvhex wrt. custom external atoms of an acthex application, then the set of best models BM(P, E) is computed.  ... 
doi:10.1007/978-3-642-40564-8_31 fatcat:hfol23ll5zftdpo326anrqzs3e

SeaLion: An eclipse-based IDE for answer-set programming with advanced debugging support

PAULA-ANDRA BUSONIU, JOHANNES OETSCH, JÖRG PÜHRER, PETER SKOČOVSKÝ, HANS TOMPITS
2013 Theory and Practice of Logic Programming  
Further implemented features are a documentation generator based on the Lana annotation language, support for external solvers, and interoperability with external tools.SeaLioncomes as a plugin of the  ...  In this respect,SeaLionis the first IDE for ASP that provides debugging features that work for real-world answer-set programs and supports the rich languages of modern answer-set solvers.  ...  ., through the use of standards or the framework for external tool configurations that allows for using arbitrary external tools, e.g., for postprocessing computed answer sets.  ... 
doi:10.1017/s1471068413000410 fatcat:yvqsto7vlzfqrjzmrb5lqoke3i

A Declarative Framework for Constrained Search Problems in Manufacturing [chapter]

Sitek Pawek, Wikarek Jaroslaw
2008 Automation and Robotics  
Unlike traditional approaches, CLP provides for a natural representation of heterogeneous constraints and allows domain-specific heuristics to be used on top of generic solving techniques.  ...  Traditional mathematical programming approaches (linear programming, integer and mixed integer programming) are deficient in the following ways: their representation of constraints is artificial (commonly  ...  The original contribution of our approach consists of a declarative framework for constrained search problems, developed within the constraint logic programming (CLP) paradigm together with relational  ... 
doi:10.5772/6107 fatcat:h2skdpbe2vbpnpsjrhnas6ghgq

InstAL: An Institutional Action Language [chapter]

Julian Padget, Emad ElDeen Elakehal, Tingting Li, Marina De Vos
2016 Social Coordination Frameworks for Social Technical Systems  
Tendering Use Case We apply the current standard version of the framework to the tendering use case.  ...  AnsP rolog program and compute its answer sets -to generate finite event traces from a model, given some initial condition, and so construct a form of institutional model-checker.  ...  The computational model is realized by translating the specification language to Ans-P rolog [6] , a logic programming language under the answer set semantics (ASP) [16] , and is underpinned by a set-theoretic  ... 
doi:10.1007/978-3-319-33570-4_6 fatcat:4df4hs33d5fxrn2rcxl5vst55i

hex-Programs with Existential Quantification [chapter]

Thomas Eiter, Michael Fink, Thomas Krennwallner, Christoph Redl
2014 Lecture Notes in Computer Science  
In this paper, we present domain-specific existential quantifiers on top of HEX-programs, i.e., ASP programs with external access which may introduce new values that also show up in the answer sets.  ...  We introduce a generalized grounding algorithm for such problems, which exploits domain-specific termination criteria in order to generate a finite grounding for bounded model generation.  ...  Query Answering over Positive HEX ∃ -Programs The basic idea for query answering over programs with possibly infinite models is to compute a ground program with a single answer set that can be used for  ... 
doi:10.1007/978-3-319-08909-6_7 fatcat:hbkb5wlp4vguhfstealm3su5gu

DC Proposal: Towards a Framework for Efficient Query Answering and Integration of Geospatial Data [chapter]

Patrik Schneider
2011 Lecture Notes in Computer Science  
We seek to combine spatial reasoning, (nonmonotonic) logic programming, and ontologies for integrating geospatial databases with Semantic Web technologies.  ...  We propose a two-tier design related to HEX-programs, which should lead to a plausible trade-off between modularity and efficiency.  ...  -How does the framework behave for query answering over large data sets (e.g., the OSM data set of Austria)?  ... 
doi:10.1007/978-3-642-25093-4_28 fatcat:kixcjktwxzgc3azybnidhu6aqu

Stepwise Debugging of Description-Logic Programs [chapter]

Johannes Oetsch, Jörg Pührer, Hans Tompits
2012 Lecture Notes in Computer Science  
In this paper, we introduce a framework for interactive stepping through a DLprogram as a means for debugging which builds on recent results on stepping for standard answer-set programs.  ...  Description-logic programs (or DL-programs for short) combine logic programs under the answer-set semantics with description logics for semanticweb reasoning.  ...  It rests on a computation model where rules are subsequently added to a state. Moreover, we introduced unfounded sets and the notion of external support for DL-programs.  ... 
doi:10.1007/978-3-642-30743-0_34 fatcat:6hjtkvvucrhjbb7fywc5xefpd4

Stepwise debugging of answer-set programs

JOHANNES OETSCH, JÖRG PÜHRER, HANS TOMPITS
2017 Theory and Practice of Logic Programming  
As a solid formal basis for stepping, we develop a framework of computations for answer-set programs.  ...  We introduce a stepping methodology for answer-set programming (ASP) that allows for debugging answer-set programs and is based on the stepwise application of rules.  ...  Acknowledgements We thank the reviewers for their useful comments.  ... 
doi:10.1017/s1471068417000217 fatcat:pwi4pk775fflnn6kkq3g6pdhyq

Stepwise Debugging of Answer-Set Programs [article]

Johannes Oetsch, Jörg Pührer, Hans Tompits
2017 arXiv   pre-print
As a solid formal basis for stepping, we develop a framework of computations for answer-set programs.  ...  We introduce a stepping methodology for answer-set programming (ASP) that allows for debugging answer-set programs and is based on the stepwise application of rules.  ...  Acknowledgements We thank the reviewers for their useful comments.  ... 
arXiv:1705.06564v1 fatcat:qea4blojk5dgtoxlgtdblyaym4

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.  ...  We build a general ASP framework that describes the network semantics and allows to model specific networks with little effort.  ...  P S1 is a naf-free program, and has a unique answer set {seat(p)}. This answer set coincides with our hypothesis S 1 , which means that it is an answer set of the initial program P .  ... 
doi:10.1504/ijdmb.2011.039178 pmid:21544955 fatcat:beo22vcca5gjpbs5nkg2jqdmry

Effective Integration of Declarative Rules with External Evaluations for Semantic-Web Reasoning [chapter]

Thomas Eiter, Giovambattista Ianni, Roman Schindlauer, Hans Tompits
2006 Lecture Notes in Computer Science  
, interfacing with external sources of computation, and default negation.  ...  Their semantics is based on the notion of answer sets, providing a transparent interoperability with the Ontology Layer of the Semantic Web and full declarativity.  ...  Given a current set M of models, for each component C, we evaluate the answer sets of its possible residuals with respect to elements of M.  ... 
doi:10.1007/11762256_22 fatcat:p7aqldcddbbflfqdv65djw6agy

An Application of Declarative Languages in Distributed Architectures: ASP and DALI Microservices

Stefania Costantini, Giovanni De Gasperis, Lorenzo De Lauretis
2021 International Journal of Interactive Multimedia and Artificial Intelligence  
In this paper we introduce an approach to the possible adoption of Answer Set Programming (ASP) for the definition of microservices, which are a successful abstraction for designing distributed applications  ...  We develop a case study where we consider ASP microservices in synergy with agents defined in DALI, a well-known logic-based agent-oriented programming language developed by our research group.  ...  Acknowledgements We thank the anonymous reviewers for their interest in the DALI language, and for insightful suggestions about modern ASP grounders/solvers.  ... 
doi:10.9781/ijimai.2021.02.001 doaj:8a6cacede0734ad7bd1d96b903262fee fatcat:cnh5qedmd5eedcx6ivdhotaxz4

Answer Set Programming with External Sources

Christoph Redl, Marc Herbstritt
2012 International Conference on Logic Programming  
of Answer Set Programs with External Source Access (FWF P24090), which gave me the opportunity to work on this interesting topic.  ...  Set Programs with External Source Access (FWF P24090), in denen ich während meines Doktoratsstudiums arbeiten durfte.  ...  Query Answering over Positive HEX ∃ -Programs The basic idea for query answering over programs with possibly infinite models is to compute a ground program with a single answer set that can be used for  ... 
doi:10.4230/lipics.iclp.2012.469 dblp:conf/iclp/Redl12 fatcat:2yxyy6gqzrforanlqayak5cvxq

Declarative Belief Set Merging Using Merging Plans [chapter]

Christoph Redl, Thomas Eiter, Thomas Krennwallner
2011 Lecture Notes in Computer Science  
A prototype is implemented in MELD (MErging Library for Dlvhex) on top of the dlvhex system for HEX-programs, which are nonmonotonic logic programs with access to external sources.  ...  We present a declarative framework for belief set merging tasks over (possibly heterogeneous) knowledge bases, where belief sets are sets of literals.  ...  The belief bases with respective belief sets (as answer sets) are in external files Pj.lp. with answer sets as described above (either hard-coded or suitable computed).  ... 
doi:10.1007/978-3-642-18378-2_10 fatcat:sagdztpv2za4xcsgvnz6a33ike
« Previous Showing results 1 — 15 out of 168,688 results