Sciweavers

1036 search results - page 20 / 208
» Incompleteness of Behavioral Logics
Sort
View
CADE
2008
Springer
14 years 9 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
CALCO
2005
Springer
98views Mathematics» more  CALCO 2005»
14 years 2 months ago
Behavioral Extensions of Institutions
We show that any institution I satisfying some reasonable conditions can be transformed into another institution, Ibeh, which captures formally and abstractly the intuitions of add...
Andrei Popescu, Grigore Rosu
CADE
2006
Springer
14 years 9 months ago
Connection Tableaux with Lazy Paramodulation
It is well-known that the connection refinement of clause tableaux with paramodulation is incomplete (even with weak connections). In this paper, we present a new connection tablea...
Andrey Paskevich
RSCTC
2000
Springer
121views Fuzzy Logic» more  RSCTC 2000»
14 years 6 days ago
Situation Identification by Unmanned Aerial Vehicle
Abstract. An approach to a multi-facet task of situation identification by Unmanned Aerial Vehicle (UAV) is presented. The concept of multi-layered identification system based on s...
Hung Son Nguyen, Andrzej Skowron, Marcin S. Szczuk...
CSI
2007
83views more  CSI 2007»
13 years 8 months ago
A model-driven choreography conceptual framework
A number of languages exist that try to model the external visible behavior of services. However, they constitute incomplete solutions, either because, they do not include proper ...
Sinuhé Arroyo, Alistair Duke, José M...