Results 1 
3 of
3
Frühwirth: A LinearLogic Semantics For Constraint Handling Rules
 Proceedings of CP 2005
, 2005
"... Abstract. We motivate and develop a linear logic declarative semantics for CHR ∨ , an extension of the CHR programming language that integrates concurrent committed choice with backtrack search and a predefined underlying constraint handler. We show that our semantics maps each of these aspects of t ..."
Abstract

Cited by 23 (10 self)
 Add to MetaCart
Abstract. We motivate and develop a linear logic declarative semantics for CHR ∨ , an extension of the CHR programming language that integrates concurrent committed choice with backtrack search and a predefined underlying constraint handler. We show that our semantics maps each of these aspects of the language to a distinct aspect of linear logic. We show how we can use this semantics to reason about derivations in CHR ∨ and we present strong theorems concerning its soundness and completeness. 1
Notes Towards a Semantics for Proofsearch
"... Algorithmic proofsearch is an essential enabling technology throughout informatics. Proofsearch is the prooftheoretic realization of the formulation of logic not as a theory of deduction but rather as a theory of reduction. Whilst deductive logics typically have a welldeveloped semantics of proo ..."
Abstract
 Add to MetaCart
Algorithmic proofsearch is an essential enabling technology throughout informatics. Proofsearch is the prooftheoretic realization of the formulation of logic not as a theory of deduction but rather as a theory of reduction. Whilst deductive logics typically have a welldeveloped semantics of proofs, reductive logics are typically wellunderstood only operationally. Each deductive system can, typically, be read as a corresponding reductive system. We discuss some of the problems which must be addressed in order to provide a semantics of proofsearches of comparable value to the corresponding semantics of proofs. Just as the semantics of proofs is intimately related to the model theory of the underlying logic, so too should be the semantics of proofsearches. We discuss how to solve the problem of providing a semantics for proofsearches which adequately models both operational and logical aspects of the reductive system. 1
agents, languages and structures General Terms Languages, Design
"... Agent solutions to programming problems are often based on the BeliefDesireIntention (BDI) paradigm [12]. Beliefs represent what the agent believes to be the current state of the world. Desires specify the proactive behaviour of the agent, in that the agent works to make these true. Often desires ..."
Abstract
 Add to MetaCart
Agent solutions to programming problems are often based on the BeliefDesireIntention (BDI) paradigm [12]. Beliefs represent what the agent believes to be the current state of the world. Desires specify the proactive behaviour of the agent, in that the agent works to make these true. Often desires can be mutually exclusive or contradictory, requiring the agent to select from among them, and so BDI implementations often use goals, which can be thought of as desires with some restrictions on them (such as requiring goals to be consistent, feasible and not yet achieved). There can be several types of goals, including achievement goals, whcih are dropped once they have been achieved, and maintenance goals, which are continually monitored, even when currenlty true. Intentions are plans of action that the agent has committed to to achieve its current goals. Often there are many ways to achieve a set of goals that the agent is working on, implying the need for a mechanism to