507 Hits in 4.0 sec

Communicating ASP and the Polynomial Hierarchy [chapter]

Kim Bauters, Steven Schockaert, Dirk Vermeir, Martine De Cock
2011 Lecture Notes in Computer Science  
We show that extending answer set programs in this way allows us to capture the entire polynomial hierarchy. Funded by a joint Research Foundation-Flanders (FWO) project.  ...  The semantics and expressiveness of this framework crucially depends on the nature of the communication mechanism that is adopted.  ...  This means in particular that communicating ASP could be used to solve problems that are above the second level of the polynomial hierarchy, such as some forms of abductive reasoning [10] as well as  ... 
doi:10.1007/978-3-642-20895-9_8 fatcat:hpbfi2kwmff2rm6w2e4wrgowqa

Security and privacy in cloud computing

Rajat Soni, Smrutee Ambalkar, Pratosh Bansal
2016 2016 Symposium on Colossal Data Analysis and Networking (CDAN)  
The main advantage of the AKU scheme its support for efficient delegation and revocation of privileges in hierarchies without requiring complex cryptographic data structures.  ...  The main aim of the paper is to provide more visibility and control to the end-users and close the gap between capabilities of existing solutions and new requirements of cloud-based systems.  ...  Figure 4 shows how the cost of ASP encryption relates to the user's access level and hierarchy level of the data American Journal of Information Systems object.  ... 
doi:10.1109/cdan.2016.7570962 fatcat:g5mwhulgjnbg5ppfo6syqs5ieu

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  ...  Kim Bauters and Jeroen Janssen are funded by a joint Research Foundation-Flanders (FWO) project. Steven Schockaert is a postdoctoral fellow of the Research Foundation-Flanders (FWO).  ...  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

Page 420 of Mathematical Reviews Vol. , Issue 91A [page]

1991 Mathematical Reviews  
In particular, @P contains the polynomial accepting path versions of NP, of the counting hierarchy, and of Mod,,NP for m > 1.  ...  First, an axiom scheme for the ASP is presented. Next, the associ- ated rewriting system is defined. An asynchronous communication function differs from Milner’s x operator [R. Milner, Theoret.  ... 

Expressiveness of communication in answer set programming

2011 Theory and Practice of Logic Programming  
In other words, due to the ability of these simple ASP programs to communicate and collaborate, we move up a step in the polynomial hierarchy.  ...  Using this particular communication mechanism allows us to capture the entire polynomial hierarchy.  ...  Lastly, the paper identifies that the complexity of the main reasoning task is on the second level of the polynomial hierarchy.  ... 
doi:10.1017/s1471068411000561 fatcat:vtircf6k3jc4vfhaeufem7iyr4

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
In other words: we move up a step in the polynomial hierarchy due to the ability of these simple ASP programs to communicate and collaborate.  ...  Using this particular communication mechanism allows us to capture the entire polynomial hierarchy.  ...  Lastly, the paper identifies that the complexity of the main reasoning task is on the second level of the polynomial hierarchy.  ... 
arXiv:1109.2434v1 fatcat:z5bxhc6ncjdnhmkdonphunb2la

The Parameterized Complexity of Constraint Satisfaction and Reasoning [chapter]

Stefan Szeider
2013 Lecture Notes in Computer Science  
Parameterized Complexity is a new and increasingly popular theoretical framework for the rigorous analysis of NP-hard problems and the development of algorithms for their solution.  ...  We outline the basic concepts of Parameterized Complexity and survey some recent parameterized complexity results on problems arising in Constraint Satisfaction and Reasoning.  ...  on higher levels of the Polynomial Hierarchy.  ... 
doi:10.1007/978-3-642-41524-1_2 fatcat:ee2md36scbckvne73x7qfkw5ra

Computing secure sets in graphs using answer set programming

Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Stefan Woltran
2015 Journal of Logic and Computation  
The problem of enumerating all secure sets thus is challenging for ASP and its systems. In particular, encodings for this problem seem to require disjunction and also recursive aggregates.  ...  Problems from the area of graph theory always served as fruitful benchmarks in order to explore the performance of Answer Set Programming (ASP) systems.  ...  ASP systems.  ... 
doi:10.1093/logcom/exv060 fatcat:7wbunpddivdzrm7h66wpeeeeqe

Automata and Answer Set Programming [chapter]

Victor Marek, Jeffrey B. Remmel
2008 Lecture Notes in Computer Science  
Schlipf (Schlipf 1995) proved that the Stable Logic Programming solves all NP decision problems. We extend Schlipf's result to all search problems in the class NP.  ...  We note that the metainterpreter Metal does distinguish between the stable and supported semantics. That is, the supported models of Metal U edbQ do not necessarily determine stable models of Q.  ...  Next, apply Proposition 3, get a stable model of Metal U edb 0 and project it twice. First to get a stable model of Q and then of P.  ... 
doi:10.1007/978-3-540-92687-0_22 fatcat:cdborphgajcwtmxvxxfqei4xaq

Answer Set Programming [chapter]

Piero Bonatti, Francesco Calimeri, Nicola Leone, Francesco Ricca
2010 Lecture Notes in Computer Science  
After a formal definition of ASP, this chapter surveys the main contribution given by the Italian community to the ASP field in the last 25 years.  ...  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  ...  Italian ASP community.  ... 
doi:10.1007/978-3-642-14309-0_8 fatcat:m7vjxp43qfbgjpujf7ozr72x5q

Algebraic Signal Processing Theory: Cooley–Tukey Type Algorithms for DCTs and DSTs

Markus Puschel, Jose M.F. Moura
2008 IEEE Transactions on Signal Processing  
This means that the algorithms are not derived by manipulating the entries of transform matrices, but by a stepwise decomposition of the associated signal models, or polynomial algebras.  ...  This decomposition is based on two generic methods or algebraic principles that generalize the well-known Cooley-Tukey fast Fourier transform (FFT) and make the algorithms' derivations concise and transparent  ...  Section II explains the relationship between polynomial algebras and transforms and connects to the notion of signal model in ASP.  ... 
doi:10.1109/tsp.2007.907919 fatcat:rv76vmbqabdfxk5kz6jns4zzly

The Second Answer Set Programming Competition [chapter]

Marc Denecker, Joost Vennekens, Stephen Bond, Martin Gebser, Mirosław Truszczyński
2009 Lecture Notes in Computer Science  
Second, the ASP community has been gradually opening up to other domains.  ...  incentive to the research community to work on developing better performing systems.  ...  We are indebted to all members of the ASP and CLP community that submitted benchmarks. We are extremely grateful to everyone that participated in the contest.  ... 
doi:10.1007/978-3-642-04238-6_75 fatcat:qrm2hfnpyfaxzfricvviuif2xu

Matrix multiplication on heterogeneous platforms

O. Beaumont, V. Boudet, F. Rastello, Y. Robert
2001 IEEE Transactions on Parallel and Distributed Systems  
Intuitively, the problem is to load balance the work with different speed resources while minimizing the communication volume.  ...  Next, we introduce a (polynomial) column-based heuristic, which turns out to be very satisfactory: We derive a theoretical performance guarantee for the heuristic and we assess its practical usefulness  ...  ACKNOWLEDGMENTS The authors would like to thank the reviewers whose comments and suggestions have greatly improved the presentation of the paper.  ... 
doi:10.1109/71.963416 fatcat:x4ohe7wi3reftbm33p2y63urfu

FCA in a Logical Programming Setting for Visualization-Oriented Graph Compression [chapter]

Lucas Bourneuf, Jacques Nicolas
2017 Lecture Notes in Computer Science  
The contributions of this paper are twofold. First, we formulate and study this issue in the framework of Formal Concept Analysis.  ...  This leads to a generalized view of the initial problem offering new variants and solving approaches.  ...  Tagu (INRA Le Rheu) and N. Théret (Inserm) for providing us the networks used in the results section. We would also like to express our gratitude to the reviewers for their feedbacks.  ... 
doi:10.1007/978-3-319-59271-8_6 fatcat:j7dhxcnpnjc63apn3fqeahi66e


2009 Glasgow Mathematical Journal  
We characterize in terms of Darboux transformations the spaces in the Segal-Wilson rational Grassmannian, which lead to commutative rings of differential operators having coefficients which are rational  ...  The resulting subgrassmannian is parametrized in terms of trigonometric Calogero-Moser matrices.  ...  The research of Luc  ... 
doi:10.1017/s0017089508004813 fatcat:xmirwofsgrcy7g27wznrsximne
« Previous Showing results 1 — 15 out of 507 results