895 search results - page 152 / 179 » A Spectrum of Applications of Automated Reasoning |
LICS
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...
WETICE
2006
IEEE
15 years 3 months ago
2006
IEEE
By separating the process logic from the application code process management systems (PMS) offer promising perspectives for automation and management of business processes. Howeve...
LICS
2005
IEEE
15 years 3 months ago
2005
IEEE
We consider unranked trees, that have become an active subject of study recently due to XML applications, and characterize commonly used fragments of firstorder (FO) and monadic ...
LICS
2005
IEEE
15 years 3 months ago
2005
IEEE
We investigate model theoretic characterisations of the expressive power of modal logics in terms of bisimulation invariance. The paradigmatic result of this kind is van Benthem...
104
click to vote
ASP
2005
Springer
15 years 3 months ago
2005
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...