Researchers building multi-agent algorithms typically work with abstracted away from real applications. The abstracted problem instances allow systematic and detailed investigatio...
Paul Scerri, Pragnesh Jay Modi, Wei-Min Shen, Mili...
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Abstract. Action-probabilistic logic programs (ap-programs), a class of probabilistic logic programs, have been applied during the last few years for modeling behaviors of entities...
Gerardo I. Simari, John P. Dickerson, V. S. Subrah...
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...