2291 search results - page 118 / 459 » Logic Programming and Model Checking |
CAV
2008
Springer
15 years 4 months ago
2008
Springer
Ideally, a model checking tool should successfully tackle state space explosion for complete system validation, while providing short counterexamples when an error exists. Techniqu...
111
click to vote
ICLP
1992
Springer
15 years 6 months ago
1992
Springer
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
122
click to vote
IJFCS
2006
15 years 2 months ago
2006
The outcome of verifying software is often a `counterexample', i.e., a listing of the actions and states of a behavior not satisfying the specification. In order to understan...
111
click to vote
PPDP
2010
Springer
15 years 25 days ago
2010
Springer
Permissive-Nominal Logic (PNL) is an extension of firstorder logic where term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such...
159
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. de nite clause programs containing probabilistic facts with a ...