Filters








619,792 Hits in 4.4 sec

Expressiveness of Communication in Answer Set Programming [article]

Kim Bauters and Jeroen Janssen and Steven Schockaert and Dirk Vermeir and Martine De Cock
2011 arXiv   pre-print
We find that the problem of deciding whether a literal is in some answer set of a communicating ASP program using simple communication is NP-hard.  ...  For the most part, we deliberately only consider simple programs, i.e. programs for which computing the answer sets is in P.  ...  literal Q : l occurs in any answer set of a communicating simple program) is NP-hard.  ... 
arXiv:1109.2434v1 fatcat:z5bxhc6ncjdnhmkdonphunb2la

Expressiveness of communication in answer set programming

KIM BAUTERS, STEVEN SCHOCKAERT, JEROEN JANSSEN, DIRK VERMEIR, MARTINE DE COCK
2011 Theory and Practice of Logic Programming  
We find that the problem of deciding whether a literal is in some answer set of a communicating ASP program using simple communication isNP-hard.  ...  In this paper, we present a systematic study of the additional expressiveness offered by allowing ASP programs to communicate.  ...  literal Q : l occurs in any answer set of a communicating simple program) is NP-hard.  ... 
doi:10.1017/s1471068411000561 fatcat:vtircf6k3jc4vfhaeufem7iyr4

Communicating Answer Set Programs

Kim Bauters, Jeroen Janssen, Steven Schockaert, Dirk Vermeir, Martine De Cock, Marc Herbstritt
2010 International Conference on Logic Programming  
Although mechanisms for representing and reasoning with the combined answer set programs of multiple agents have already been proposed, the actual gain in expressivity when adding communication has not  ...  Answer set programming is a form of declarative programming that has proven very successful in succinctly formulating and solving complex problems.  ...  Acknowledgment The authors wish to thank the anonymous reviewers for their references to related work, as well as for their comments and suggestions that helped to improve the quality of this  ... 
doi:10.4230/lipics.iclp.2010.34 dblp:conf/iclp/BautersJSVC10 fatcat:s2vukya2pzagnpcavzdzwkb6hq

Communicating ASP and the Polynomial Hierarchy [chapter]

Kim Bauters, Steven Schockaert, Dirk Vermeir, Martine De Cock
2011 Lecture Notes in Computer Science  
Communicating answer set programming is a framework to represent and reason about the combined knowledge of multiple agents using the idea of stable models.  ...  The communication mechanism we introduce in this paper allows us to focus on a sequence of programs, where each program in the sequence may successively eliminate some of the remaining models.  ...  Introduction Communicating answer set programming is an extension of answer set programming (ASP) in which a number of logic programs, with their own knowledge and reasoning capabilities, can communicate  ... 
doi:10.1007/978-3-642-20895-9_8 fatcat:hpbfi2kwmff2rm6w2e4wrgowqa

Cooperating Answer Set Programming [chapter]

Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
2006 Lecture Notes in Computer Science  
We present a formalism for logic program cooperation based on the answer set semantics. The system consists of independent logic programs that are connected via a sequential communication channel.  ...  When presented with an input set of literals from its predecessor, a logic program computes its output as an answer set of itself, enriched with the input.  ...  To prove that any problem of Σ P n , with n ≥ 2, can be expressed in a cooperating program system of n programs under the global answer set semantics, we have to show a construction of such a system P  ... 
doi:10.1007/11799573_18 fatcat:e2l243gxbfhs7idrqcwbetc7bu

Hierarchical Decision Making in Multi-agent Systems Using Answer Set Programming [chapter]

Davy Van Nieuwenborgh, Marina De Vos, Stijn Heymans, Dirk Vermeir
2007 Lecture Notes in Computer Science  
We present a multi-agent formalism based on extended answer set programming.  ...  When presented with an input set of literals from its predecessor, an agent computes its output as an extended answer set of its program enriched with the input, carefully eliminating contradictions that  ...  The expression a < b means a is preferred upon b. Due to the results in [39] , normal answer set programming can be reduced to extended answer set programming.  ... 
doi:10.1007/978-3-540-69619-3_2 fatcat:7xrm6w3ulbcgviqkl4pdzxlabu

Introduction to the 30th International Conference on Logic Programming Special Issue

MICHAEL LEUSCHEL, TOM SCHRIJVERS
2014 Theory and Practice of Logic Programming  
Related Paradigms: Abductive Logic Programming, Inductive Logic Programming, Constraint Logic Programming, Answer-Set Programming; Applications: Databases, Data Integration and Federation, Software Engineering  ...  The 30th edition of the International Conference of Logic Programming took place in Vienna in July 2014 at the Vienna Summer of Logic - the largest scientific conference in the history of logic.  ...  Bound Founded Answer Set Programming (BFASP) is an extension of Answer Set Programming (ASP) that extends stable model semantics to numeric variables.  ... 
doi:10.1017/s1471068414000581 fatcat:6fczd6mhxjcutozkk6t23lvn5e

Answer Set Programming [chapter]

Piero Bonatti, Francesco Calimeri, Nicola Leone, Francesco Ricca
2010 Lecture Notes in Computer Science  
Answer Set Programming (ASP), referred to also as Disjunctive Logic Programming under the stable model semantics (DLP), is a powerful formalism for Knowledge Representation and Reasoning.  ...  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.  ...  systems in the area of Answer Set Programming [110, 111] .  ... 
doi:10.1007/978-3-642-14309-0_8 fatcat:m7vjxp43qfbgjpujf7ozr72x5q

A layered semantics for a parallel object-oriented language

Pierre America, Jan Rutten
1992 Formal Aspects of Computing  
The main contribution of this semantics is an accurate mathematical model of the most important concept in object-oriented programming: the object.  ...  At the program level we give a precise definition of the observable input/output behaviour of a particular program, which could be used at a later stage to decide the issue of full abstractness.  ...  These object labels may occur in the communication statements of a program, and in this way the program can communicate with the outside world. For instance, the statement 0 0 • 1!  ... 
doi:10.1007/bf01211312 fatcat:lme4vhlzeneehg34j6ccxnz3jq

Anonymous On-line Communication Between Program Analyses [article]

Marek Trtik
2015 arXiv   pre-print
We propose a light-weight client-server model of communication between program analyses. Clients are individual analyses and the server mediates their communication.  ...  We evaluated the proposed communication model for all possible combinations of three clients on more than 400 benchmarks and the results show that the communication model performs well in practice.  ...  Context: a specification of a set of paths in a canonical program Here we propose a simple specification for a set of program paths in a canonical program with restricted expressivity.  ... 
arXiv:1511.02415v1 fatcat:niq4xponbbbhfejr4gcmpmmone

Introduction to the 35th International Conference on Logic Programming Special Issue

ESRA ERDEM, ANDREA FORMISANO, GERMÁN VIDAL, FANGKAI YANG
2019 Theory and Practice of Logic Programming  
This volume contains the regular papers of the 35th International Conference on Logic Programming (ICLP 2019), held in Las Cruces, New Mexico, USA, from September 20 to September 25, 2019.  ...  Our gratitude must be extended to Torsten Schaub, who is serving in the role of President of the Association of Logic Programming (ALP), to all the members of the ALP Executive Committee and to Mirek Truszczynski  ...  , Editor-in-Chief of TPLP.  ... 
doi:10.1017/s1471068419000413 fatcat:tdqkbkdj7vc7pguna6dlddeliu

Parallelism in ADA: Program design and meaning [chapter]

Brian H. Mayoh
1980 Lecture Notes in Computer Science  
The methodology is based on ideas of Milner and it can be used when designing parallel programs in languages other than ADA,  ...  This paper suggests a programming methodology and it gives a precise definition of the ADA form of parallelism.  ...  -e Answer, (2) PE_M((S I x x S m) U (_L~ fail, deadlock)) by S 1 X X S m attaching communication histories to a set of concurrent processes as a whole~ not to each concurrent process in the set.  ... 
doi:10.1007/3-540-09981-6_18 fatcat:4pjx4zrlmvfpldct5xyk75lkae

Parallelism in ADA: Program Design and Meaning

Brian H. Mayoh
1980 DAIMI Report Series  
The methodology is based on the ideas of Milner and it can be used when designing parallel programs in languages other than ADA.  ...  This paper suggests a programming methodology and it gives a precise definition of the ADA form of parallelism.  ...  -e Answer, (2) PE_M((S I x x S m) U (_L~ fail, deadlock)) by S 1 X X S m attaching communication histories to a set of concurrent processes as a whole~ not to each concurrent process in the set.  ... 
doi:10.7146/dpb.v8i103.6528 fatcat:i4nk7a7425apxheox2dcv2ussm

Coordinating Agents in OO [chapter]

Frank S. de Boer, Cees Pierik, Rogier M. van Eijk, John-Jules Ch. Meyer
2004 Lecture Notes in Computer Science  
It consists of an explicit answer statement by means of which an agent can specify that it is willing to accept some specified messages.  ...  The beliefs and reasoning capabilities of an agent are specified in terms of a corresponding abstract data type.  ...  The expressions in the programming language are the basis for the set of logical expressions. The variable z is a logical variable.  ... 
doi:10.1007/978-3-540-25930-5_2 fatcat:xxjh5dqrcnafxb3xzodoipkr4q

Constraint Answer Set Programming: Integrational and Translational (or SMT-based) Approaches [article]

Yuliya Lierler
2021 arXiv   pre-print
Constraint answer set programming or CASP, for short, is a hybrid approach in automated reasoning putting together the advances of distinct research areas such as answer set programming, constraint processing  ...  Constraint answer set programming demonstrates promising results, including the development of a multitude of solvers: acsolver, clingcon, ezcsp, idp, inca, dingo, mingo, aspmt, clingo[l,dl], and ezsmt  ...  Acknowledgments I would like to acknowledge and cordially thank many of my collaborators with whom we had a chance to contribute to an exciting field of Constraint Answer Set Programming and many of my  ... 
arXiv:2107.08252v1 fatcat:czwpmcx4dja4xhdpp5cbdrhkt4
« Previous Showing results 1 — 15 out of 619,792 results