Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...
Federico Ramponi, Debasish Chatterjee, Sean Summer...
Adoption of advanced automated SE (ASE) tools would be favored if a business case could be made that these tools are more valuable than alternate methods. In theory, software pred...
Tim Menzies, Oussama El-Rawas, Jairus Hihn, Martin...
Higher level semantics are considered useful in the geospatial domain, yet there is no general consensus on the form these semantics should take. Indeed, knowledge representation p...
Spontaneous multi-party interaction – conversation among groups of three or more participants – is part of daily life. While automated modeling of such interactions has receiv...
Paul M. Aoki, Margaret H. Szymanski, Luke D. Plurk...
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating...