756 search results - page 76 / 152 » Using Logic Programs to Reason about Infinite Sets |
185
click to vote
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
ILP
2007
Springer
15 years 4 months ago
2007
Springer
The management of business processes has recently received a lot of attention. One of the most interesting problems is the description of a process model in a language that allows ...
LFCS
1992
Springer
15 years 1 months ago
1992
Springer
We describe a logic for reasoning about higher-order strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets ...
102
click to vote
SIGSOFT
2008
ACM
15 years 10 months ago
2008
ACM
Runtime monitoring allows programmers to validate, for instance, the proper use of application interfaces. Given a property specification, a runtime monitor tracks appropriate run...
129
click to vote
CSL
2007
Springer
15 years 4 months ago
2007
Springer
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 ï...