7103 search results - page 418 / 1421 » Program Generation and Components |
141
click to vote
ICLP
2007
Springer
15 years 10 months ago
2007
Springer
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
148
click to vote
JELIA
2004
Springer
15 years 9 months ago
2004
Springer
This paper is an analysis of two knowledge representation extensions of logic programming, namely Answer Set Programming and ID-Logic. Our aim is to compare both logics on the leve...
161
click to vote
CSFW
2007
IEEE
15 years 8 months ago
2007
IEEE
We present interpretations of type systems for secure information flow in Hoare logic, complementing previous encodings in binary (e.g. relational) program logics. Treating base-l...
138
click to vote
IDEAL
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Ordinal data play an important part in financial forecasting. For example, advice from expert sources may take the form of "bullish", "bearish" or &qu...
128
click to vote
ESEC
1995
Springer
15 years 8 months ago
1995
Springer
This paper presents the results of an exploratory experiment investigating the use of program metrics to predict reachability graph size, reachability graph generation time, and d...