Filters








77,508 Hits in 4.9 sec

Proving properties of committed choice logic programs

Lee Naish
1989 The Journal of Logic Programming  
Next, we investigate proving properties concerning success and finite failure of guarded clause programs with restricted input-output modes.  ...  The effect on completeness of programs is of major importance.  ...  PROVING PROPERTIES OF GC PROGRAMS Our approach to the semantics of programs using don't care nondeterminism is the same as that for pure logic programs: we use the straightforward declarative semantics  ... 
doi:10.1016/0743-1066(89)90010-1 fatcat:5kd3w5xelfbhzav6sz3qtodonq

Page 6658 of Mathematical Reviews Vol. , Issue 90K [page]

1990 Mathematical Reviews  
{For the entire collection see MR 90f:68008.} 90k:68157 68T25 03B70 Naish, Lee (5-MELB-C) Proving properties of committed choice logic programs. J. Logic Programming 7 (1989), no. 1, 63-84.  ...  ‘Don’t care’ (or commited choice) nondeterminism can be introduced by operations such as ‘commit’ in concurrent PROLOG and ‘cut’ in sequential PROLOG.  ... 

Finite failures and partial computations in concurrent logic languages

Moreno Falaschi, Giorgio Levi
1990 Theoretical Computer Science  
is paper investigates some semantic properties of concurrent logic languages. Concurrent logic languages with a commit operator differ from pure iogic languages :n rhe finite failure set.  ...  27]. he mechanism of ~:a.s sxpliciily designed for concurrent logic language o allow nondetertrol.  ...  e logic languages Committed-choice logic languages are based on orn Clause Logic (HC1L), extended with t e commit operator [4, 21, 22, 5, 27 -J, which was int duced in concurrent logic langnages.  ... 
doi:10.1016/0304-3975(90)90061-l fatcat:k7issa46yverzatjfma25auctu

Verifying Communicating Agents by Model Checking in a Temporal Action Logic [chapter]

Laura Giordano, Alberto Martelli, Camilla Schwind
2004 Lecture Notes in Computer Science  
This logic provides a simple formalization of the communicative actions in terms of their effects and preconditions.  ...  Furthermore it allows to specify interaction protocols by means of temporal constraints representing permissions and commitments.  ...  LTL is widely used to prove properties of (possibly concurrent) programs by means of model checking techniques.  ... 
doi:10.1007/978-3-540-30227-8_8 fatcat:fr3ec4kko5ayti4s6shjveqthq

A knowledge-theoretic semantics for concurrent MetateM [chapter]

Michael Wooldridge
1997 Lecture Notes in Computer Science  
Reasoning about a Concurrent METATEM system then reduces to proving properties of the corresponding logical theory.  ...  to properties of Concurrent METATEM systems.  ...  Proving properties of sys then reduces to proving properties of the KL n theory.  ... 
doi:10.1007/bfb0013597 fatcat:wo2iz22murg4hfrs5tb3zqouum

PROPOSITIONAL DYNAMIC LOGIC FOR REASONING ABOUT FIRST-CLASS AGENT INTERACTION PROTOCOLS

Tim Miller, Peter McBurney
2011 Computational intelligence  
In this paper, we show that propositional dynamic logic (PDL) can be used to represent and reason about the outcomes of first-class protocols.  ...  We prove that, for a restricted class of non-terminating protocols, proofs about them can be transformed to proofs about terminating protocols, making them automatable.  ...  The compositionality of programs is reflected in the logic, and properties about programs can be used by breaking compound programs into their atomic parts, and proving properties about these.  ... 
doi:10.1111/j.1467-8640.2011.00387.x fatcat:ispo57cjwrairhjdvodzqn2t6m

Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction [article]

Hariolf Betz, Thom W. Frühwirth
2010 arXiv   pre-print
We show how to apply the linear-logic semantics to decide program properties and to prove operational equivalence of CHRv programs across the boundaries of language paradigms.  ...  Constraint Handling Rules (CHR) is a declarative committed-choice programming language with a strong relationship to linear logic.  ...  ACKNOWLEDGMENTS We are grateful to the reviewers of an earlier version of this paper for their helpful remarks. Hariolf Betz has been funded by the University of Ulm with LGFG grant #0518.  ... 
arXiv:1009.2900v1 fatcat:gajckaucozaarpqfoq7iz5n7ke

Page 7577 of Mathematical Reviews Vol. , Issue 2000k [page]

2000 Mathematical Reviews  
certain choices of logical constants.  ...  Typically, supervenience is thought of as a relation between a property and a class of properties.  ... 

Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction

Hariolf Betz, Thom Frühwirth
2013 ACM Transactions on Computational Logic  
We will see that it is well-suited to model the committed-choice rules of CHR.  ...  Linear logic is a sub-structural logical formalism [Girard 1987 ] that has been shown to bear a close relationship to concurrent committed-choice systems [Miller 1992; Fages et al. 2001 ].  ...  ACKNOWLEDGMENTS We are grateful to the reviewers of an earlier version of this paper for their helpful remarks. Hariolf Betz has been funded by Baden-Württemberg federal state grant LGFG #0518.  ... 
doi:10.1145/2422085.2422086 fatcat:5npuse5qcjhvrhisrceioncbdq

Agent oriented programming: An overview of the framework and summary of recent research [chapter]

Yoav Shoham
1994 Lecture Notes in Computer Science  
AOP augments these logics with formal notions of choices, capabilities, commitments, and possibly others.  ...  In computer science these mentalistic-sounding notions are actually given precise computational meanings, and are used not only to prove properties of distributed systems, but to program them  ... 
doi:10.1007/3-540-58095-6_9 fatcat:bmsz655qq5h6pnjjlzbhci5nl4

Page 2569 of Mathematical Reviews Vol. , Issue 98D [page]

1998 Mathematical Reviews  
The remaining four chapters focus on the developments of suitable representations and proving correctness properties of various communication protocols.  ...  Programming 28 (1997), no. 2-3, 171-192. Summary: “The two models presented in this paper provide two different semantics for an extension of Dijkstra’s language of guarded commands.  ... 

Page 6188 of Mathematical Reviews Vol. , Issue 91K [page]

1991 Mathematical Reviews  
The authors investigate some semantic properties of concurrent committed-choice logic languages. Such languages differ from pure logic languages in the finite failure set.  ...  The properties of programs that contain perpetual com- putation controlled by guard-commit mechanisms can be discussed using the semantics.”  ... 

Agent-oriented programming

Yoav Shoham
1993 Artificial Intelligence  
The mental state of agents is described formally in an extension of standard epistemic logics: beside temporalizing the knowledge and belief operators, AOP introduces operators for obligation, decision  ...  A new computational framework is presented, called agent-oriented programming (AOP), which can be viewed as a specialization of object-oriented programming.  ...  The initial motivation behind that line of research was to prove properties of distributed protocols.  ... 
doi:10.1016/0004-3702(93)90034-9 fatcat:j7smcjsocfadnbbgsxc2zcc6tm

Interactive foundations of computing

Peter Wegner
1998 Theoretical Computer Science  
The claim that interactive systems have richer behavior than algorithms is surprisingly easy to prove.  ...  In the final section the robustness of interactive models in expressing open systems, programming in the large, graphical user interfaces, and agent-oriented artificial intelligence is compared to the  ...  Preserving freedom of choice implies lazy commitment (never commit today to something that can be decided tomorrow).  ... 
doi:10.1016/s0304-3975(97)00154-0 fatcat:jfv7xn5nlveqjagut2rkidjdem

A Program Logic for Handling Java Card's Transaction Mechanism [chapter]

Bernhard Beckert, Wojciech Mostowski
2003 Lecture Notes in Computer Science  
Strong invariants can be used to ensure "rip out" properties of JAVA CARD programs (properties that are to be maintained in case of unexpected termination of the program).  ...  In this paper we extend a program logic for verifying JAVA CARD applications by introducing a "throughout" operator that allows us to prove "strong" invariants.  ...  Our choice is the JAVA CARD language [6] (a subset of JAVA) for programming smart cards. This choice is motivated by the following reasons.  ... 
doi:10.1007/3-540-36578-8_18 fatcat:rjauanmwsbeztoduc2wvjv26xa
« Previous Showing results 1 — 15 out of 77,508 results