Sciweavers

764 search results - page 129 / 153
» On the Expressibility of Stable Logic Programming
Sort
View
CORR
2004
Springer
176views Education» more  CORR 2004»
14 years 11 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
MCMASTER
1993
15 years 3 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
PKDD
2007
Springer
146views Data Mining» more  PKDD 2007»
15 years 5 months ago
A Method for Multi-relational Classification Using Single and Multi-feature Aggregation Functions
This paper presents a novel method for multi-relational classification via an aggregation-based Inductive Logic Programming (ILP) approach. We extend the classical ILP representati...
Richard Frank, Flavia Moser, Martin Ester
HASE
2007
IEEE
15 years 3 months ago
Multiple Pre/Post Specifications for Heap-Manipulating Methods
Automated verification plays an important role for high assurance software. This typically uses a pair of pre/post conditions as a formal (but possibly partial) specification of e...
Wei-Ngan Chin, Cristina David, Huu Hai Nguyen, She...
CORR
2008
Springer
151views Education» more  CORR 2008»
14 years 11 months ago
Checking the Quality of Clinical Guidelines using Automated Reasoning Tools
Requirements about the quality of clinical guidelines can be represented by schemata borrowed from the theory of abductive diagnosis, using temporal logic to model the time-orient...
Arjen Hommersom, Peter J. F. Lucas, Patrick van Bo...