Sciweavers

700 search results - page 75 / 140
» On Termination of Constraint Logic Programs
Sort
View
ATAL
2007
Springer
15 years 3 months ago
Negotiation by abduction and relaxation
This paper studies a logical framework for automated negotiation between two agents. We suppose an agent who has a knowledge base represented by a logic program. Then, we introduc...
Chiaki Sakama, Katsumi Inoue
POPL
2011
ACM
14 years 2 months ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
APLAS
2006
ACM
15 years 5 months ago
A Bytecode Logic for JML and Types
This document contains the Isabelle/HOL sources underlying our paper A bytecode logic for JML and types [2], updated to Isabelle 2008. We present a program logic for a subset of s...
Lennart Beringer, Martin Hofmann
SIGSOFT
2005
ACM
15 years 12 months ago
Fluent temporal logic for discrete-time event-based models
Fluent model checking is an automated technique for verifying that an event-based operational model satisfies some state-based declarative properties. The link between the event-b...
Emmanuel Letier, Jeff Kramer, Jeff Magee, Sebasti&...
TOOLS
1999
IEEE
15 years 3 months ago
Constraint Diagrams: A Step Beyond UML
The Unified Modeling Language (UML) is a set of notations for modelling object-oriented systems. It has become the de facto standard. Most of its notations are diagrammatic. An ex...
Joseph Gil, John Howse, Stuart Kent