Sciweavers

2291 search results - page 122 / 459
» Logic Programming and Model Checking
Sort
View
CAV
2005
Springer
127views Hardware» more  CAV 2005»
15 years 8 months ago
Incremental and Complete Bounded Model Checking for Full PLTL
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...
Keijo Heljanko, Tommi A. Junttila, Timo Latvala
CAV
2012
Springer
222views Hardware» more  CAV 2012»
13 years 4 months ago
Leveraging Interpolant Strength in Model Checking
Craig interpolation is a well known method of abstraction successfully used in both hardware and software model checking. The logical strength of interpolants can affect the quali...
Simone Fulvio Rollini, Ondrej Sery, Natasha Sharyg...
ICTAI
2007
IEEE
15 years 8 months ago
ExOpaque: A Framework to Explain Opaque Machine Learning Models Using Inductive Logic Programming
In this paper we developed an Inductive Logic Programming (ILP) based framework ExOpaque that is able to extract a set of Horn clauses from an arbitrary opaque machine learning mo...
Yunsong Guo, Bart Selman
MICAI
2007
Springer
15 years 8 months ago
On Reachability of Minimal Models of Multilattice-Based Logic Programs
In this paper some results are obtained regarding the existence and reachability of minimal fixed points for multiple-valued functions on a multilattice. The concept of inf-preser...
Jesús Medina, Manuel Ojeda-Aciego, Jorge Ru...
145
Voted
ENTCS
2007
190views more  ENTCS 2007»
15 years 2 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...