Sciweavers

2152 search results - page 297 / 431
» On Automating the Calculus of Relations
Sort
View
134
Voted
ASP
2005
Springer
15 years 6 months ago
An Experimental Study of Search Strategies and Heuristics in Answer Set Programming
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
Enrico Giunchiglia, Marco Maratea
ECSQARU
2005
Springer
15 years 6 months ago
Multiple Semi-revision in Possibilistic Logic
Semi-revision is a model of belief change that differs from revision in that a new formula is not always accepted. Later, Fuhrmann defined multiple semi-revision by replacing a n...
Guilin Qi, Weiru Liu, David A. Bell
92
Voted
ICCBR
2005
Springer
15 years 6 months ago
Transfer in Visual Case-Based Problem Solving
We present a computational model of case-based visual problem solving. The Galatea model and the two experimental participants modeled in it show that 1) visual knowledge is suffic...
Jim Davies, Ashok K. Goel, Nancy J. Nersessian
89
Voted
ISPEC
2005
Springer
15 years 6 months ago
Risk Assessment of Production Networks Using Honeynets - Some Practical Experience
: Threats for today’s production networks range from fully automated worms and viruses to targeted, highly sophisticated multi-phase attacks carried out manually. In order to pro...
Stephan Riebach, Erwin P. Rathgeb, Birger Töd...
101
Voted
LPAR
2005
Springer
15 years 6 months ago
Pushdown Module Checking
Model checking is a useful method to verify automatically the correctness of a system with respect to a desired behavior, by checking whether a mathematical model of the system sat...
Laura Bozzelli, Aniello Murano, Adriano Peron