1716 search results - page 83 / 344 » Proving Conditional Termination |
107
Voted
FROCOS
2005
Springer
15 years 6 months ago
2005
Springer
We define a general notion of a fragment within higher order type theory; a procedure for constraint satisfiability in combined fragments is outlined, following Nelson-Oppen sche...
102
Voted
ARGMAS
2004
Springer
15 years 6 months ago
2004
Springer
In this paper we propose a new persuasion dialogue game for agent communication. We show how this dialogue game is modeled by a framework based on social commitments and arguments....
107
click to vote
CDC
2009
IEEE
14 years 11 months ago
2009
IEEE
Abstract-- We consider a variation of the classical MarkovDubins problem dealing with curvature-constrained, shortest paths in the plane with prescribed initial and terminal positi...
112
Voted
FORTE
2009
14 years 11 months ago
2009
Abstract. We propose a verification method for parameterized systems with global conditions. The method is based on context-sensitive constraints, a symbolic representation of infi...
109
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We prove several decidability and undecidability results for -PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of...