We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
An enormous amount of information is currently available through specialized services of digital libraries (DLs). However the specification and development of DLs are very complex...
David Patricio Viscarra del Pozo, Lena Veiga e Sil...
The goal of Information Extraction tasks is to identify, categorize, classify, relate, and normalize specific information of interest found in free text, and to make that informat...
Multiagent systems have become popular over the last few years for building complex, adaptive systems in a distributed, heterogeneous setting. Multiagent systems tend to be more r...
Scott A. DeLoach, Walamitien H. Oyenan, Eric T. Ma...