Sciweavers

446 search results - page 66 / 90
» Automating Theories in Intuitionistic Logic
Sort
View
167
Voted
DAC
2006
ACM
16 years 6 months ago
State encoding of large asynchronous controllers
A novel method to solve the state encoding problem in Signal Transition Graphs is presented. It is based on the structural theory of Petri nets and can be applied to large specifi...
Josep Carmona, Jordi Cortadella
CADE
2008
Springer
16 years 6 months ago
randoCoP: Randomizing the Proof Search Order in the Connection Calculus
Abstract. We present randoCoP, a theorem prover for classical firstorder logic, which integrates randomized search techniques into the connection prover leanCoP 2.0. By randomly re...
Thomas Raths, Jens Otten
162
Voted
LICS
2008
IEEE
16 years 6 days ago
Focusing on Binding and Computation
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...
Daniel R. Licata, Noam Zeilberger, Robert Harper
TARK
2005
Springer
15 years 11 months ago
Semantics for multi-agent only knowing: extended abstract
s for Multi-Agent Only Knowing (extended abstract) Arild Waaler1,2 and Bjørnar Solhaug3,4 1 Finnmark College, Norway 2 Dep. of Informatics, University of Oslo, Norway 3 SINTEF ICT...
Arild Waaler, Bjørnar Solhaug
KR
2004
Springer
15 years 11 months ago
Reaching Agreement Through Argumentation: A Possibilistic Approach
Negotiation plays a key role as a means for sharing information and resources with the aim of looking for a common agreement. This paper proposes a new approach based on possibili...
Leila Amgoud, Henri Prade