Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
In several applications of logic programming and Transaction Logic, such as, planning, trust management and independent Semantic Web Services, an action might produce incomplete f...
A reachability question is a search across feasible paths through a program for target statements matching search criteria. In three separate studies, we found that reachability q...
—Software instrumentation is a powerful and flexible technique for analyzing the dynamic behavior of programs. By inserting extra code in an application, it is possible to study...
Alex Skaletsky, Tevi Devor, Nadav Chachmon, Robert...
Behavioural models offer the ability to simulate autonomous agents like organisms and living beings. Psychological studies have showed that the human behaviour can be described by...