2138 search results - page 253 / 428 » Logics for the Relational Syllogistic |
193
click to vote
CADE
2010
Springer
15 years 7 months ago
2010
Springer
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...
174
click to vote
ICFP
2010
ACM
15 years 7 months ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
184
click to vote
ML
2006
ACM
15 years 6 months ago
2006
ACM
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. A common way to measure performance in these domains is to use precision and recall i...
140
click to vote
FUIN
2007
15 years 6 months ago
2007
Abstract. Josephs and Udding’s DI-Algebra offers a convenient way of specifying and verifying designs that must rely upon delay-insensitive signalling between modules (asynchrono...
210
click to vote
SAC
2008
ACM
15 years 6 months ago
2008
ACM
We present a way to add user's background knowledge to formal concept analysis. The type of background knowledge we deal with relates to relative importance of attributes in ...