2962 search results - page 305 / 593 » Reasoning on Association Rules |
155
click to vote
ICLP
1994
Springer
15 years 10 months ago
1994
Springer
The consequences of a logic program depend in general upon both the rules of the program and its language. However the consequences of some programs are independent of the choice ...
148
Voted
ALP
1990
Springer
15 years 10 months ago
1990
Springer
Conditional Equational Programming is an elegant way to uniformly integrate important features of functional and logic programming. Efficientmethods for equation solving are thus ...
161
click to vote
LICS
1990
IEEE
15 years 10 months ago
1990
IEEE
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
175
click to vote
ECSQARU
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Ordinal Conditional Functions (OCFs) are one of the predominant frameworks to define belief change operators. In his original paper Spohn defines OCFs as functions from t...
155
click to vote
DEON
2004
Springer
15 years 10 months ago
2004
Springer
Often a set of imperatives or norms seems satisfiable from the outset, but conflicts arise when ways to fulfill all are ruled out by unfortunate circumstances. Semantic methods to ...