2162 search results - page 46 / 433 » Automated Reasoning on Feature Models |
157
click to vote
ILP
2001
Springer
15 years 8 months ago
2001
Springer
In the line of previous work by S. Muggleton and C. Sakama, we extend the logical characterization of inductive logic programming, to normal logic programs under the stable models ...
131
Voted
ECSQARU
1999
Springer
15 years 7 months ago
1999
Springer
In this paper we develop frameworks for logical systems which are able to re ect not only nonmonotonic patterns of reasoning, but also paraconsistent reasoning. For this we conside...
124
click to vote
TIME
2002
IEEE
15 years 8 months ago
2002
IEEE
In this paper, we propose a logical approach to represent and reason about different time granularities. We identify a time granularity as a discrete infinite sequence of time po...
148
click to vote
CSL
2006
Springer
15 years 7 months ago
2006
Springer
A complete and decidable propositional logic for reasoning about states of probabilistic sequential programs is presented. The state logic is then used to obtain a sound Hoare-styl...
115
Voted
CSL
2008
Springer
15 years 5 months ago
2008
Springer
We survey two basic techniques for showing that the monadic second-order theory of a structure is decidable. In the first approach, one deals with finite fragments of the theory (g...