Filters








126,282 Hits in 12.4 sec

Elimination of Local Variables from Definite Logic Programs

Javier Álvez, Paqui Lucio
2005 Electronical Notes in Theoretical Computer Science  
In this paper, we introduce an effective method that takes a definite logic program and transforms it into a local variable free (definite) program.  ...  In logic programming, a variable is said to be local if it occurs in a clause body but not in its head atom.  ...  Acknowledgement We are very grateful for the helpful comments we receive from our referees.  ... 
doi:10.1016/j.entcs.2005.01.037 fatcat:kdvivkaoijehdj76j4llnqnjse

An Algorithm for Local Variable Elimination in Normal Logic Programs [chapter]

Javier Álvez, Paqui Lucio
2006 Lecture Notes in Computer Science  
In this paper, we introduce an algorithm that eliminates local variables from a wide proper subclass of normal logic programs.  ...  Local variables appear naturally in practical logic programming, but they complicate several aspects such as negation, compilation, memoization, static analysis, program approximation by neural networks  ...  Acknowledgment: We would like to thank the anonymous referees for their valuable comments, which aided in improving the quality of this paper and in clarifying the presentation.  ... 
doi:10.1007/11680093_5 fatcat:e55avejfj5e2bmohxggsprgna4

Propositional dynamic logic with local assignment

M.L. Tiomkin, J.A. Makowsky
1985 Theoretical Computer Science  
We propose an extension of Propositional Dynamic l_bgic which allows a new kind of program terms---local assignments to propositional variables.  ...  In this logic, many notions, like equivalence of programs, looping and finitely branching, are expressible on a propositional level.  ...  So, from a point of view of proving valid formulas the operator -(converse) is not necessary and we can eliminate it from our definitions. Proof.  ... 
doi:10.1016/0304-3975(85)90031-3 fatcat:ba5y5ohtj5hxtlxdmaglpogyum

Transforming normal logic programs to constraint logic programs

Kanchana Kanchanasut, Peter J. Stuckey
1992 Theoretical Computer Science  
The completed predicate definitions in P'", if they do not contain local variables, can be used as a basis for expanding each negated atom in the bodies of P"'.  ...  We show that for a class of programs where every negative subgoal can be expanded, the resultant program R' is a definite logic program with equality and disequality constraints.  ...  a local-variable-free definition.  ... 
doi:10.1016/0304-3975(92)90286-o fatcat:m4iyrlortzeexjs7d7wiwukwcy

Types and invariants in the refinement calculus

Carroll Morgan, Trevor Vickers
1990 Science of Computer Programming  
I. tatmductioa Program developments in the style of Dijkstra [2] rely on imp&cit typing of variables.  ...  (Note that Definitions 3.1 and 3.3 differ slightly from the notation of [9], where specification (1) would be written n : [m > 0, n 6 m].  ...  An untyped local variable x is introduced using brackets i[. . .]I. It is defined as f-oliows: the declaration vat and scope Definition 3.4 (Untyped local variable).  ... 
doi:10.1016/0167-6423(90)90024-8 fatcat:px6ldealcnax7cpe4v3dim5qji

Types and invariants in the refinement calculus [chapter]

Carroll Morgan
1989 Lecture Notes in Computer Science  
I. tatmductioa Program developments in the style of Dijkstra [2] rely on imp&cit typing of variables.  ...  (Note that Definitions 3.1 and 3.3 differ slightly from the notation of [9], where specification (1) would be written n : [m > 0, n 6 m].  ...  An untyped local variable x is introduced using brackets i[. . .]I. It is defined as f-oliows: the declaration vat and scope Definition 3.4 (Untyped local variable).  ... 
doi:10.1007/3-540-51305-1_22 fatcat:jdzsiagnxjfypbyqwufmq5dvya

Types and Invariants in the Refinement Calculus [chapter]

Carroll Morgan, Trevor Vickers
1992 On the Refinement Calculus  
I. tatmductioa Program developments in the style of Dijkstra [2] rely on imp&cit typing of variables.  ...  (Note that Definitions 3.1 and 3.3 differ slightly from the notation of [9], where specification (1) would be written n : [m > 0, n 6 m].  ...  An untyped local variable x is introduced using brackets i[. . .]I. It is defined as f-oliows: the declaration vat and scope Definition 3.4 (Untyped local variable).  ... 
doi:10.1007/978-1-4471-3273-8_9 fatcat:xboacmesanfvjh552scxqmmmye

The Transformational Approach to Program Development [chapter]

Alberto Pettorossi, Maurizio Proietti, Valerio Senni
2010 Lecture Notes in Computer Science  
We also describe the use of the transformation methodology for the synthesis of logic programs from first-order specifications.  ...  Then, we present the transformation strategies and, through some examples, we illustrate their use for improving program efficiency via the elimination of unnecessary variables, the reduction of nondeterminism  ...  Many thanks also to Agostino Dovier and Enrico Pontelli, editors of this book, for their invitation to present the contributions of the program transformation methodology in the field of logic programming  ... 
doi:10.1007/978-3-642-14309-0_6 fatcat:piligaf47fhflk6gorirwm3bdq

Logic-based Binding Time Analysis for Java Using Reaching Definitions

Susumu Yamazaki, Takayuki Kando, Michihiro Matsumoto, Tsuneo Nakanishi, Teruaki Kitasuka, Akira Fukuda
2005 IPSJ Digital Courier  
Then, we propose a new algorithm of logic-based binding time analysis using reaching definitions analysis, which is widely used among many other analyses.  ...  Especially, instruction-dependent processes are almost entirely eliminated.  ...  We are grateful to Etsuya Shibayama in Tokyo Institute of Technology and Hidehiko Masuhara in Tokyo University for many helpful comments and stimulating discussions.  ... 
doi:10.2197/ipsjdc.1.128 fatcat:xkfpydhq6vdj3hvjsyv2niu4vq

Eliminating negation from normal logic programs [chapter]

Kanchana Kanchanasut, Peter Stuckey
1990 Lecture Notes in Computer Science  
The completed predicate definitions in P ω , if they do not contain local variables, can be used as a basis for expanding each negated atom in the bodies of P ω .  ...  We show that for a class of programs where every negative subgoal can be expanded, the resultant program P is a definite logic program with equality and disequality constraints.  ...  We call a variable y ∈ Y i a local variable [12] if it does not occur inx =s i . If no variables in each E i of p are local, we say p has an eligible definition .  ... 
doi:10.1007/3-540-53162-9_41 fatcat:ajgj4pigs5bzzf7m2icjsjthae

Programmed Strategies for Program Verification

Richard B. Kieburtz
2007 Electronical Notes in Theoretical Computer Science  
In Programatica, predicate definitions and property assertions written in P-logic, a programming logic for Haskell, can be embedded in the text of a Haskell program module.  ...  Plover is an automated property-verifier for Haskell programs that has been under development for the past three years as a component of the Programatica project.  ...  The strategy that renames with fresh variables all occurrences of variables bound in the pattern of a local definition cannot fail.  ... 
doi:10.1016/j.entcs.2007.02.045 fatcat:3gnit7ab3zd4hilkj7h2ahsjmu

Transformational methodology for proving termination of logic programs

M.R.K. Krishna Rao, Deepak Kapur, R.K. Shyamasundar
1998 The Journal of Logic Programming  
A transformation procedure is presented to derive a term rewriting system from a given well-moded logic program such that the termination of the derived rewrite system implies the termination of the logic  ...  A methodology for proving the termination of well-moded logic programs is developed by reducing the termination problem of logic programs to that of term rewriting systems.  ...  Klop of CWI for their helpful comments. Thanks are also due to the anonymous referees, whose comments have greatly improved the presentation. Dr.  ... 
doi:10.1016/s0743-1066(97)00028-9 fatcat:kp4gnme23ra7fnopvh65wcc7ny

A mechanism for information control in parallel systems

Richard P. Reitman
1979 Proceedings of the seventh symposium on Operating systems principles - SOSP '79  
Denning and Denning have shown how the information security of sequential programs can be certified by a compile-time mechanism [3].  ...  This paper extends their work by presenting a mechanism for certifying parallel programs. The mechanism is shown to be consistent with an axiomatic description of information transmission.  ...  This research has benefited greatly from discussions with Greg Andrews, Carl Hauser, and Nancy McCracken.  ... 
doi:10.1145/800215.806570 dblp:conf/sosp/Reitman79 fatcat:lgzwfw2tnrd5jle6t2w6c65rem

Visual Theorem Proving with the Incredible Proof Machine [chapter]

Joachim Breitner
2016 Lecture Notes in Computer Science  
In particular, we describe a way to determine the scope of local assumptions and variables implicitly. Our practical classroom experience backs these claims.  ...  The Incredible Proof Machine is an easy and fun to use program to conduct formal proofs.  ...  Furthermore, I thank the anonymous referees for the encouraging review and the list of feature requests.  ... 
doi:10.1007/978-3-319-43144-4_8 fatcat:guklssjnpbfmnnbsuzdlrcgjkq

The Characterization on the Uniqueness of Answer Set for Prioritized Logic Programs [chapter]

Yan Zhang, Yun Bai
2003 Lecture Notes in Computer Science  
Specifically, we propose a characterization on the uniqueness of answer set for prioritized logic programs, which has a weaker form than the traditional local stratification for general logic programs.  ...  In this paper, we investigate basic properties of prioritized logic programs in the context of answer set semantics.  ...  In Definition 2, 3 q is a ground extended logic program obtained from # by eliminating some rules from # .  ... 
doi:10.1007/978-3-540-39592-8_49 fatcat:dt5gnebz3ne7difd2gqrpb4cti
« Previous Showing results 1 — 15 out of 126,282 results