Sciweavers

3032 search results - page 296 / 607
» Description Logic Rules
Sort
View
BIRTHDAY
2010
Springer
15 years 5 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe
LOGCOM
2008
94views more  LOGCOM 2008»
15 years 4 months ago
Preservation of Interpolation Features by Fibring
Fibring is a metalogical constructor that permits to combine different logics by operating on their deductive systems under certain natural restrictions, as for example that the t...
Walter Alexandre Carnielli, João Rasga, Cri...
CADE
2009
Springer
15 years 11 months ago
SPASS Version 3.5
SPASS is an automated theorem prover for full first-order logic with equality and a number of non-classical logics. This system description provides an overview of our recent deve...
Christoph Weidenbach, Dilyana Dimova, Arnaud Fietz...
LICS
2007
IEEE
15 years 10 months ago
Resource modalities in game semantics
The description of resources in game semantics has never achieved the simplicity and precision of linear logic, because of a misleading conception: the belief that linear logic is...
Paul-André Melliès, Nicolas Tabareau
KBSE
2006
IEEE
15 years 10 months ago
An Instant Message-Driven User Interface Framework for Thin Client Applications
Today, thin client applications often rely on the infrastructure of the WWW to deliver their user interfaces (UIs) to clients. While this approach does not require the deployment ...
Matthias Book, Volker Gruhn, Gerald Mucke