Filters








14,021 Hits in 4.1 sec

On Some Differences Between Semantics of Logic Program Updates [chapter]

João Alexandre Leite
2004 Lecture Notes in Computer Science  
In this paper we redefine such existing semantics, and set forth a new one, all in the more general setting of Generalized Logic Programs, in a way that facilitates their comparisons.  ...  Since the introduction of logic program updates based on causal rejection of rules, several different semantics were set forth.  ...  (Extended) Logic Programs (GLP) (Logic Programs allowing both default and strong negation in the heads of rules), and [4] define the semantics of Update Answer Sets for sequences of Extended Logic Programs  ... 
doi:10.1007/978-3-540-30498-2_38 fatcat:o42tce4mxvd5tfeqv4ajqo4ita

Static analysis of logic programs for independent and parallelism

Dean Jacobs, Anno Langen
1992 The Journal of Logic Programming  
Requirements on the Abstract Domain and Operations The domain Answer of sets of substitutions in the concrete semantics is replaced by a domain Answer' in the abstract semantics.  ...  Debray 191 maps a variable to the set of variables on which it depends.  ... 
doi:10.1016/0743-1066(92)90034-z fatcat:fvbtbpldsrcrdadsp4cdcpgvhu

Exception-Based Knowledge Updates [article]

Martin Slota, Joao Leite
2017 arXiv   pre-print
On the opposite side of the spectrum stand the semantics for updating Answer-Set Programs that need to rely on rule syntax.  ...  Then it proposes a generic scheme for specifying semantic rule update operators, based on the idea of viewing a program as the set of sets of RE-models of its rules; updates are performed by introducing  ...  These insights also allowed us to address the long enduring problem of state condensing, i.e. transforming a sequence of answer-set programs -interpreted as updates -into a single answer-set program written  ... 
arXiv:1706.00585v1 fatcat:ghw76swyi5bhrbdram762ktzpu

On Supporting Strong and Default Negation in Answer-Set Program Updates [chapter]

Martin Slota, Martin Baláž, João Leite
2014 Lecture Notes in Computer Science  
Existing semantics for answer-set program updates fall into two categories: either they consider only strong negation in heads of rules, or they primarily rely on default negation in heads of rules and  ...  In this paper we pinpoint the limitations of both these approaches and argue that both types of negation should be first-class citizens in the context of updates.  ...  Answer-set programming [3, 4] forms the natural basis for investigation of rule updates, and various approaches to answer-set program updates have been explored throughout the last 15 years [5] [6]  ... 
doi:10.1007/978-3-319-12027-0_4 fatcat:qpsvhwyerjbtvntk7ofaoiwy7m

Control-flow recovery from partial failure reports

Peter Ohmann, Alexander Brooks, Loris D'Antoni, Ben Liblit
2017 Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2017  
We perform an extensive evaluation of our techniques on a wide variety of failing applications (section 6).  ...  We also introduce a new subclass of regular languages, the unreliable trace languages, which are particularly suited to answering control-flow queries in polynomial time.  ...  Opinions, findings, conclusions, or recommendations expressed herein are those of the authors and do not necessarily reflect the views of the sponsoring agencies.  ... 
doi:10.1145/3062341.3062368 dblp:conf/pldi/OhmannBDL17 fatcat:uimd6uy4p5gkno65rbfnif3syy

On Strong and Default Negation in Logic Program Updates (Extended Version) [article]

Martin Slota, Martin Baláz, João Leite
2014 arXiv   pre-print
Existing semantics for answer-set program updates fall into two categories: either they consider only strong negation in heads of rules, or they primarily rely on default negation in heads of rules and  ...  In this paper we pinpoint the limitations of both these approaches and argue that both types of negation should be first-class citizens in the context of updates.  ...  Proceedings, vol-ume 7519 of Lecture Notes in Computer Science, 372-384. Springer. [Slota and Leite 2013] Slota, M., and Leite, J. 2013. On condensing a sequence of updates in answer-set programming.  ... 
arXiv:1404.6784v4 fatcat:njuzm3nhsbhg7m2467okfakh7e

Faster Fully Dynamic Transitive Closure in Practice

Kathrin Hanauer, Monika Henzinger, Christian Schulz, Domenico Cantone, Simone Faro
2020 Symposium on Experimental and Efficient Algorithms  
The fully dynamic transitive closure problem asks to maintain reachability information in a directed graph between arbitrary pairs of vertices, while the graph undergoes a sequence of edge insertions and  ...  Our results indicate that our new algorithms outperform all state-of-the-art algorithms on all types of input considerably in practice.  ...  outperformed by several orders of magnitude.  ... 
doi:10.4230/lipics.sea.2020.14 dblp:conf/wea/HanauerH020 fatcat:upqg4kcgmjewfjbx4qaeft6dve

Incremental and Modular Context-sensitive Analysis [article]

Isabel Garcia-Contreras, Jose F. Morales, Manuel V. Hermenegildo
2020 arXiv   pre-print
This paper describes, implements, and evaluates an algorithm that performs efficient context-sensitive analysis incrementally on modular partitions of programs.  ...  This has been achieved to date through incremental global analysis fixpoint algorithms that achieve cost reductions at fine levels of granularity, such as changes in program lines.  ...  This is why we have encoded the abstract information of the program in each program point in a way that we can reconstruct any of the possible computing sequence the analysis graph.  ... 
arXiv:1804.01839v5 fatcat:dedzgwfxdzgznczgtfuq72r4s4

Verified Analysis of List Update Algorithms

Maximilian P. L. Haslbeck, Tobias Nipkow, Marc Herbstritt
2016 Foundations of Software Technology and Theoretical Computer Science  
This paper presents a machine-verified analysis of a number of classical algorithms for the list update problem: 2-competitiveness of move-to-front, the lower bound of 2 for the competitiveness of deterministic  ...  list update algorithms and 1.6-competitiveness of the randomized COMB algorithm, the best randomized list update algorithm known to date.  ...  Function OPT 2 rs [x, y] that takes a request sequence rs and a state [x, y] and returns an answer sequence is defined easily by recursion on rs.  ... 
doi:10.4230/lipics.fsttcs.2016.49 dblp:conf/fsttcs/HaslbeckN16 fatcat:gjxxfflnabdgjdk5flecee2zne

KOBAS 2.0: a web server for annotation and identification of enriched pathways and diseases

Chen Xie, Xizeng Mao, Jiaju Huang, Yang Ding, Jianmin Wu, Shan Dong, Lei Kong, Ge Gao, Chuan-Yun Li, Liping Wei
2011 Nucleic Acids Research  
Here, we report a web server, KOBAS 2.0, which annotates an input set of genes with putative pathways and disease relationships based on mapping to genes with known annotations.  ...  High-throughput experimental technologies often identify dozens to hundreds of genes related to, or changed in, a biological or pathological process.  ...  probe sets on a microarray).  ... 
doi:10.1093/nar/gkr483 pmid:21715386 pmcid:PMC3125809 fatcat:36wrprodjvedjplipxlklmztiy

Dali server update

Liisa Holm, Laura M. Laakso
2016 Nucleic Acids Research  
scaling projection of a set of structures specified by the user.  ...  The latest update of the server provides enhanced analytics for the study of sequence and structure conservation.  ...  The Dali program optimizes a structural alignment, that is, a sequential set of one-to-one correspondences between C-alpha atoms (13, 14) .  ... 
doi:10.1093/nar/gkw357 pmid:27131377 pmcid:PMC4987910 fatcat:qdvksi2goncsdbisz4aoeb23fy

Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time [article]

Seth Pettie
2014 arXiv   pre-print
Our algorithms are based on an efficient split-findmin data structure, which maintains a collection of sequences of weighted elements that may be split into smaller subsequences.  ...  We present a deterministic algorithm for computing the sensitivity of a minimum spanning tree (MST) or shortest path tree in O(mα(m,n)) time, where α is the inverse-Ackermann function.  ...  I thank Bob Tarjan for encouraging me to finally publish the complete version of this paper.  ... 
arXiv:1407.1910v1 fatcat:6lvaiyot2fgljhpzu7lwgxpzx4

Sensitivity Analysis of Minimum Spanning Trees in Sub-inverse-Ackermann Time [chapter]

Seth Pettie
2005 Lecture Notes in Computer Science  
Our algorithms are based on an efficient split-findmin data structure, which maintains a collection of sequences of weighted elements that may be split into smaller subsequences.  ...  We present a deterministic algorithm for computing the sensitivity of a minimum spanning tree (MST) or shortest path tree in O(m log α(m, n)) time, where α is the inverse-Ackermann function.  ...  Acknowledgements I thank Bob Tarjan for encouraging me to publish the complete version of this paper.  ... 
doi:10.1007/11602613_96 fatcat:7nnugmbvdfbxzobwtwkb3wo3ju

Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time

Seth Pettie
2015 Journal of Graph Algorithms and Applications  
Our algorithms are based on an efficient split-findmin data structure, which maintains a collection of sequences of weighted elements that may be split into smaller subsequences.  ...  We present a deterministic algorithm for computing the sensitivity of a minimum spanning tree (MST) or shortest path tree in O(m log α(m, n)) time, where α is the inverse-Ackermann function.  ...  Acknowledgements I thank Bob Tarjan for encouraging me to publish the complete version of this paper.  ... 
doi:10.7155/jgaa.00365 fatcat:wnm235bunjfwdddo5jvvzw43wm

An Application of ASP in Nuclear Engineering: Explaining the Three Mile Island Nuclear Accident Scenario [article]

B. N. Hanna, L. T. Trieu, T. C. Son, N. T. Dinh
2020 arXiv   pre-print
We describe an Answer Set Programming (ASP) representation of an NPP, which consists of declarations of state variables, components, their connections, and rules encoding the plant behavior.  ...  The focus is on two modules: diagnosis and explanation of events that happened in NPPs.  ...  Youngblood III (Idaho National Laboratory)for his constructive comments on earlier versions of this paper and his continuous support throughout the development of an ASP-based system for NPP operators.  ... 
arXiv:2008.01253v1 fatcat:3uts2dcatjelrdd2ziiaiosdye
« Previous Showing results 1 — 15 out of 14,021 results