Sciweavers

446 search results - page 87 / 90
» Automating Theories in Intuitionistic Logic
Sort
View
130
Voted
CSL
2007
Springer
15 years 4 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ļ...
Arnold Beckmann
121
Voted
TASE
2008
IEEE
14 years 10 months ago
Modeling and Supervisory Control of Railway Networks Using Petri Nets
In this paper we deal with the problem of modeling railway networks with Petri nets so as to apply the theory of supervisory control for discrete event systems to automatically de...
Alessandro Giua, Carla Seatzu
GIS
2010
ACM
14 years 8 months ago
Topological reasoning between complex regions in databases with frequent updates
Reasoning about space has been a considerable field of study both in Artificial Intelligence and in spatial information theory. Many applications benefit from the inference of ...
Arif Khan, Markus Schneider
79
Voted
WWW
2004
ACM
15 years 11 months ago
Semantic email
This paper investigates how the vision of the Semantic Web can be carried over to the realm of email. We introduce a general notion of semantic email, in which an email message co...
Luke McDowell, Oren Etzioni, Alon Y. Halevy, Henry...
CADE
2005
Springer
15 years 10 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard