4513 search results - page 249 / 903 » Logic programming with satisfiability |
134
click to vote
TASE
2008
IEEE
15 years 3 months ago
2008
IEEE
The safety of pointer programs is an important issue in high-assurance software design, and their verification remains a major challenge. Pointer Logic has been proposed to verify...
133
click to vote
FCT
2003
Springer
15 years 9 months ago
2003
Springer
This paper presents a method for the decomposition of HML formulae. It can be used to decide whether a process algebra term satisfies a HML formula, by checking whether subterms s...
109
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the...
123
click to vote
JOLLI
1998
15 years 3 months ago
1998
The postulate of Recovery, among the six postulates for theory contraction, formulated and studied by Alchourr´on, G¨ardenfors and Makinson is the one that has provoked most cont...
138
Voted
ILP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Logical Bayesian Networks (LBNs) have recently been introduced as another language for knowledge based model construction of Bayesian networks, besides existing languages...