Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “Logic program”

Program Logic

Helen E. Ganley, Martin Ward · JONA The Journal of Nursing Administration · 2001

Helen E. Ganley, RN, CM, Adv. Dip QM, Cert. IV QMA, MQIHC, Australian Quality Council Certified Assessor, Evaluation and Quality Improvement Program Coordinator, [email protected], Martin Ward, RMN, SRN, Grad. Dip. Public Sector Mgt. (Health), Master of Mgt. (UTS Sydney), Clinical Nursing Consultant-Emergency Department, Royal North Shore Hospital and Community Health Services, Sydney, New South Wales, Australia. Presented in part at the International Congress on Performance Measurement & Improvement in Health Care, 14th International ISQua Conference on Quality in Health Care, Chicago, Illinois, Nov. 12-15, 1997. Supported in part by a research grant from Northern Sydney Health, Sydney, Australia (H. Ganley). The views expressed herein are those of the authors and do not necessarily reflect the views of Royal North Shore Hospital and Community Health Services.

Cited by 3

Program logic.

Joyce Siette (841582), Laura Dodds (11039534), Piers Dawes (630748) et al. · Figshare · 2022

Cited by 0Open access

Program Logic Foundations: Putting the Logic Back into Program Logic

Andrew Hawkins · Journal of MultiDisciplinary Evaluation · 2020

Background: Program logic is one of the most used tools by the public policy evaluator. There is, however, little explanation in the evaluation literature about the logical foundations of program logic or discussion of how it may be determined if a program is logical. This paper was born on a long journey that started with program logic and ended with the logic of evaluation. Consistent throughout was the idea that the discipline of program evaluation is a pragmatic one, concerned with applied social science and effective action in complex, adaptive systems. It gradually became the central claim of this paper that evidence-based policy requires sound reasoning more urgently than further development and testing of scientific theory. This was difficult to reconcile with the observation that much evaluation was conducted within a scientific paradigm, concerned with the development and testing of various types of theory. Purpose: This paper demonstrates the benefits of considering the core essence of a program to be a proposition about the value of a course of action. This contrasts with a research-based paradigm in which programs are considered to be a type of theory, and in which experimental and theory-driven evaluations are conducted. Experimental approaches focus on internal validity of knowledge claims about programs and on discovering stable cause and effect relationships—or, colloquially, ‘what works?’. Theory-driven approaches tend to focus on external validity and in the case of the realist approach, the search for transfactual causal mechanisms—extending the ‘what works’ mantra to include ‘for whom and in what circumstances’. On both approaches, evaluation aspires to be a scientific pursuit for obtaining knowledge of general laws of phenomena, or in the case of realists, replicable context-mechanism-outcome configurations. This paper presents and seeks to justify an approach rooted in logic, and that supports anyone to engage in a reasonable and democratic deliberation about the value of a course of action. It is consistent with systems thinking, complexity and the associated limits to certainty for determining the value of a proposed, or actual, course of action in the social world. It suggests that evaluation should learn from the past and have an eye toward the future, but that it would be most beneficial if concerned with evaluating in the present, in addressing the question ‘is this a good idea here and now? Setting: Not applicable. Intervention: Not applicable Research design: Not applicable. Findings: In seeking foundations of program logic, this paper exposes roots that extend far deeper than the post-enlightenment, positivist and post-positivist social science search for stable cause and effect relationships. These roots lie in the 4th century BCE with Aristotle’s ‘enthymeme’. The exploration leads to conclusions about the need for a greater focus on logic and reasoning in the design and evaluation of programs and interventions for the public good. Science and research are shown to play a crucial role in providing reasons or warrants to support a claim about the value of a course of action; however, one subordinate to the alpha-discipline of logical evaluation and decision making that must consider what is feasible given the context, capability and capacity available, not to mention values and ethics. Program Design Logic (PDL) is presented as an accessible and incremental innovation that may be used to determine if a program makes sense ‘on paper’ in the design stage as well as ‘in reality’ during delivery. It is based on a configurationalist theory of causality and the concepts of ‘necessary’ and ‘sufficient’ conditions. It is intended to guide deliberation and decision making across the life cycle of any intervention intended for the public good.

Cited by 4Open access

Program Logic and Program Analysis

Kohei Honda, Nobuko Yoshida, Martin Berger · 2008

One of the central merits of compositional program logics [18] as a foundation of software engineering is their potential ability to describe a large class of properties of programs relative to a chosen notion of observability. One open issue in achieving such descriptive power has been the lack of a precise logical treatment of pragmatically significant language features such as higher-order procedures, expressions with side effects and shared mutable data structures.

Cited by 0

Logic program forms

Antic, Christian · SPIRE - Sciences Po Institutional REpository · 2023

Logic program forms have been recently introduced by the author as proper generalizations of logic programs in the setting of (semi-)automatic logic programming via analogical reasoning. The purpose of this paper is to define a a semantics of forms in the same spirit as for programs.

Cited by 0Open access

Logic program synthesis

Yves Deville, Kung-Kiu Lau · The Journal of Logic Programming · 1994

Cited by 65Open access

Program logic model.

Mary K. Twis (12975514), Andrea Cimino (12975517), Morgan Files (12975520) · Figshare · 2022

Cited by 0Open access

Logic program proportions

Christian Antić · Annals of Mathematics and Artificial Intelligence · 2023

Abstract The purpose of this paper is to present a fresh idea on how symbolic learning might be realized via analogical reasoning. For this, we introduce directed analogical proportions between logic programs of the form “ P transforms into Q as R transforms into S ” as a mechanism for deriving similar programs by analogy-making. The idea is to instantiate a fragment of a recently introduced abstract algebraic framework of analogical proportions in the domain of logic programming. Technically, we define proportions in terms of modularity where we derive abstract forms of concrete programs from a “known” source domain which can then be instantiated in an “unknown” target domain to obtain analogous programs. To this end, we introduce algebraic operations for syntactic logic program composition and concatenation. Interestingly, our work suggests a close relationship between modularity, generalization, and analogy which we believe should be explored further in the future. In a broader sense, this paper is a further step towards a mathematical theory of logic-based analogical reasoning and learning with potential applications to open AI-problems like commonsense reasoning and computational learning and creativity.

Cited by 7Open access

From process logic to program logic

Kohei Honda · 2004

We present a process logic for the p -calculus with the linear/affine type discipline [6, 7, 31, 32, 33, 59, 60]. Built on the preceding studies on logics for programs and processes, simple systems of assertions are developed, capturing the classes of behaviours ranging from purely functional interactions to those with destructive update, local state and genericity. A central feature of the logic is representation of the behaviour of an environment as the dual of that of a process in an assertion, which is crucial for obtaining compositional proof systems. From the process logic we can derive compositional program logics for various higher-order programming languages, whose soundness is proved via their embeddings into the process logic. In this paper, the key technical framework of the process logic and its applications is presented focussing on pure functional behaviour and a prototypical call-by-value functional language, leaving the full technical development to [27, 26].

Cited by 8

Intervention Logic/ Program Logic: Toward Good Practice

Karen Baehler · ANU Press eBooks · 2007

Although it is often possible to assess policy separately from service delivery, good final outcomes for citizens invariably depend on smart policies being effectively implemented. It makes sense, therefore, to look for ways of improving performance in both realms -policy and service delivery -simultaneously and collaboratively. A contrivance known as intervention logic or program logic is being recognised in Australasia as one such tool for bridging the policy-implementation divide and thereby contributing to organisational change and renewal. Logic models work by introducing a single framework for designing, managing, and evaluating programs and projects. This chapter will briefly describe that single framework and discuss recent applications of logic modelling in New Zealand's public sector, including lessons learned about good and bad practice in logic modelling.

Cited by 6Open access

Locational Disadvantage: Program Logic

Zapart, S, Silk, J, Harris-Roxas, BF et al. · UNSWorks (University of New South Wales, Sydney, Australia) · 2017

This document sets out the program logic for the Locational Disadvantage program. It describes how it was developed, identifies the three streams of work and the activities to be conducted within those streams, and the short and long term outcomes.

Cited by 0Open access

Functional Logic Program Transformations

Hanus Michael, Steven Libby · arXiv (Cornell University) · 2026

Many tools used to process programs, like compilers, analyzers, or verifiers, perform transformations on their intermediate program representation, like abstract syntax trees. Implementing such program transformations is a non-trivial task, since it is necessary to iterate over the complete syntax tree and apply various transformations at nodes in a tree. In this paper we show how the features of functional logic programming are useful to implement program transformations in a compact and comprehensible manner. For this purpose, we propose to write program transformations as partially defined and non-deterministic operations. Since the implementation of non-determinism usually causes some overhead compared to deterministically defined operations, we compare our approach to a deterministic transformation method. We evaluate these alternatives for the functional logic language Curry and its intermediate representation FlatCurry which is used in various analysis and verification tools and compilers.

Cited by 0Open access

Functional Logic Program Transformations

Hanus Michael, Steven Libby · ArXiv.org · 2026

Many tools used to process programs, like compilers, analyzers, or verifiers, perform transformations on their intermediate program representation, like abstract syntax trees. Implementing such program transformations is a non-trivial task, since it is necessary to iterate over the complete syntax tree and apply various transformations at nodes in a tree. In this paper we show how the features of functional logic programming are useful to implement program transformations in a compact and comprehensible manner. For this purpose, we propose to write program transformations as partially defined and non-deterministic operations. Since the implementation of non-determinism usually causes some overhead compared to deterministically defined operations, we compare our approach to a deterministic transformation method. We evaluate these alternatives for the functional logic language Curry and its intermediate representation FlatCurry which is used in various analysis and verification tools and compilers.

Cited by 0Open access