Filters








100,969 Hits in 2.9 sec

Relativized hyperequivalence of logic programs for modular programming [article]

Miroslaw Truszczyński, Stefan Woltran
2009 arXiv   pre-print
It seems to be especially well suited for applications in program optimization and modular programming due to its flexibility that allows us to restrict, independently of each other, the head and body  ...  We study relativized hyperequivalence for the three semantics of logic programs given by stable, supported and supported minimal models.  ...  Introduction We study variants of relativized hyperequivalence that are relevant for the development and analysis of disjunctive logic programs with modular structure.  ... 
arXiv:0907.4128v1 fatcat:2poidird5zewfouyllw3sviz6q

Relativized hyperequivalence of logic programs for modular programming

MIROSŁAW TRUSZCZYŃSKI, STEFAN WOLTRAN
2009 Theory and Practice of Logic Programming  
We study relativized hyperequivalence for the three semantics of logic programs given by stable, supported, and supported minimal models.  ...  It seems to be especially well suited for applications in program optimization and modular programming due to its flexibility that allows us to restrict, independently of each other, the head and body  ...  As we noted, such problems arise naturally in the context of modular design of logic programs, yet they have received essentially no attention so far.  ... 
doi:10.1017/s1471068409990159 fatcat:i5pimxx4bbchhhxugdrsy2sqhe

Relativized Hyperequivalence of Logic Programs for Modular Programming [chapter]

Mirosław Truszczyński, Stefan Woltran
2008 Lecture Notes in Computer Science  
We study variants of relativized hyperequivalence that are relevant for the development and analysis of disjunctive logic programs with modular structure.  ...  We study relativized hyperequivalence for the three semantics of logic programs given by stable, supported and supported minimal models.  ...  As we noted, such problems arise naturally in the context of modular design of logic programs, yet they have received essentially no attention so far.  ... 
doi:10.1007/978-3-540-89982-2_48 fatcat:w4vmedxcafca5jx5zx5hdqvwgq

Declarative semantics for contradictory modular logic programs [chapter]

Anastasia Analyti, Sakti Pramanik
1994 Lecture Notes in Computer Science  
A prioritized modular logic program (PMP) consists of a set of modules and a partial order < def on the predicate definitions (M, p), where M is a module and p is a predicate exported by M.  ...  We present the reliable semantics for PMPs . The goal of the reliable semantics is to draw reliable conclusions from possibly contradictory PMPs.  ...  Conclus ions We have presented the reliable semantics (RS) of prioritized modular logic programs (PMPs).  ... 
doi:10.1007/3-540-58495-1_25 fatcat:rqexiua5szgmne6nxgyqsjuaey

A semantics for modular general logic programs

Sandro Etalle
1998 Theoretical Computer Science  
Here we propose a declarative compositional semantics for general logic programs.  ...  In the field of logic programming, the need for a compositional semantics has been long recognized, however, while for definite (i.e. negationfree) logic programs a few such semantics have been proposed  ...  Introduction Modularity in Logic Programming. Modularity is a crucial feature of most modem programming languages.  ... 
doi:10.1016/s0304-3975(97)00191-6 fatcat:wbxy4dlid5dhdazovrolwd5vsu

A calculus for the construction of modular prolog programs

D.T. Sannella, L.A. Wallen
1992 The Journal of Logic Programming  
Miller [9] presents a theory of modularity for a logic programming language based on nested implication.  ...  Goguen and Meseguer 141 also present a theory of modularity based on the Clear specification language for a (sorted) logic programming language of Horn clauses with equality.  ...  The newly declared structure also contributes to the structure environment for the benefit of nested encapsulated structure declarations, to which it appears as a previously defined structure.  ... 
doi:10.1016/0743-1066(92)90042-2 fatcat:prfxctdk3zgcdmw3bmriw4vtzi

A modular and generic analysis server system for functional logic programs

Michael Hanus, Fabian Skrlac
2014 Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation - PEPM '14  
We present the design, implementation, and application of a system, called CASS, for the analysis of functional logic programs.  ...  In order to analyze larger applications consisting of dozens or hundreds of modules, CASS supports a modular and incremental analysis of programs.  ...  The authors are grateful to Heiko Hoffmann for his contribution to an initial version of the analysis system and to Sandra Dylus for her suggestions to improve this paper.  ... 
doi:10.1145/2543728.2543744 dblp:conf/pepm/HanusS14 fatcat:cia3dj2jcjcfzll7xumflsx2rq

The abstract state machines method for modular design and analysis of programming languages

Egon Börger
2014 Journal of Logic and Computation  
We show how programming features (read: programming constructs) modularize not only the source programs, but also the program property statements and their proofs. 1 1 This text originates from an invited  ...  This provided a transparent, modular structure of small, simple ASM component models which are easy to reuse-not only for the specification of models, but also for the analysis of their properties by both  ...  Examples of horizontal Prolog/WAM refinements For purely incremental (in logic called conservative) extensions we cite the following five examples: constraint logic programming: • a ground model ASM for  ... 
doi:10.1093/logcom/exu077 fatcat:7quppauog5eyvaahlbvlrk7w3u

Modular logic metaprogramming

Karl Klose, Klaus Ostermann
2010 Proceedings of the ACM international conference on Object oriented programming systems languages and applications - OOPSLA '10  
In logic metaprogramming, programs are not stored as plain textfiles but rather derived from a deductive database.  ...  While the benefits of this approach for metaprogramming are obvious, its incompatibility with separate checking limits its applicability to large-scale projects.  ...  of logic programming make it particularly well-suited for a formal treatment.  ... 
doi:10.1145/1869459.1869499 dblp:conf/oopsla/KloseO10 fatcat:bemdzqhczvbtjbybha2foyxj6i

Iris from the ground up: A modular foundation for higher-order concurrent separation logic

RALF JUNG, ROBBERT KREBBERS, JACQUES-HENRI JOURDAN, ALEŠ BIZJAK, LARS BIRKEDAL, DEREK DREYER
2018 Journal of functional programming  
Iris is a framework for higher-order concurrent separation logic, which has been implemented in the Coq proof assistant and deployed very effectively in a wide variety of verification projects.  ...  Iris was designed with the express goal of simplifying and consolidating the foundations of modern separation logics, but it has evolved over time, and the design and semantic foundations of Iris itself  ...  We thank Philippa Gardner for helpful feedback, and Rose Hoberman for editing advice.  ... 
doi:10.1017/s0956796818000151 fatcat:dqloex3225b7xcq3ij5lpveqim

Modular verification of linked lists with views via separation logic

Jonas Braband Jensen, Lars Birkedal, Peter Sestoft
2010 Proceedings of the 12th Workshop on Formal Techniques for Java-Like Programs - FTFJP '10  
For modularity, we build on a fragment of higherorder separation logic and use abstract predicates to give a specification with respect to which clients can be proved correct.  ...  We present a separation logic specification and verification of linked lists with views, a data structure from the C5 collection library for .NET.  ...  Introduction Separation logic [Rey02] is a generalization of Hoare logic better suited for reasoning about heap data in imperative programming.  ... 
doi:10.1145/1924520.1924524 dblp:conf/ecoop/JensenBS10 fatcat:w7ydfbfwunhwzntt7zfvv7snjq

Modular semantics for a UML statechart diagrams kernel and its extension to multicharts and branching time model-checking

Stefania Gnesi, Diego Latella, Mieke Massink
2002 The Journal of Logic and Algebraic Programming  
We show how the modularity of our semantics definition can be exploited to define extensions, in particular we show an extension to models composed of collections of communicating statechart diagrams,  ...  Finally we present all the conceptual issues related to building a tool for action based branching time model-checking, for the automatic verification of formal correctness of UML multicharts.  ...  The authors thank Istvan Majzik for the fruitful discussions on the UML and its semantics.  ... 
doi:10.1016/s1567-8326(01)00012-1 fatcat:jhrw7ln5gfhqhderzlwwplxi6q

Generalized sufficient conditions for modular termination of rewriting [chapter]

Bernhard Gramlich
Algebraic and Logic Programming  
This result generalizes known su cient syntactical criteria for modular termination of rewriting and provides the basis for a couple of derived modularity results.  ...  Whereas con uence is modular this does not hold true in general for termination. By means of a careful analysis of potential counterexamples we prove the following abstract result.  ...  Wirth for useful comments on preliminary versions of this paper.  ... 
doi:10.1007/bfb0013819 dblp:conf/alp/Gramlich92 fatcat:ck4tu62ugrajrn7rn574bhttze

EPiC Series in Computing Propagators and Solvers for the Algebra of Modular Systems

Bart Bogaerts, Eugenia Ternovska, David Mitchell
2017 Pages 227-248 LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning   unpublished
In this paper, we construct a solver for the model expansion task for a complex modular system from an expression in the algebra and black-box propagators or solvers for the primitive modules.  ...  The Algebra of Modular Systems is a knowledge representation framework that provides a method for formally specifying such systems in purely semantic terms.  ...  The work is motivated primarily by "knowledge-intensive" computing contexts, where the individual modules are defined in (possibly different) declarative languages, such as logical theories or logic programs  ... 
fatcat:5jevuenyj5afrpd2dd66ygkeku

Promoting Modular Nonmonotonic Logic Programs

Thomas Krennwallner, Marc Herbstritt
2011 International Conference on Logic Programming  
In this paper, we present our current work on Modular Nonmonotonic Logic Programs (MLPs), which are logic programs under answer set semantics with modules that have contextualized input provided by other  ...  Modularity in Logic Programming has gained much attention over the past years. To date, many formalisms have been proposed that feature various aspects of modularity.  ...  This issue has been identified and various notions for modularizing logic programs have been proposed to support testing logic programs, reusing and abstracting components, and maintaining program code  ... 
doi:10.4230/lipics.iclp.2011.274 dblp:conf/iclp/Krennwallner11 fatcat:xe25b4l525acbar67bkfegue2q
« Previous Showing results 1 — 15 out of 100,969 results