Sciweavers

723 search results - page 20 / 145
» Reducing the complexity of the issue logic
Sort
View
JAR
2007
142views more  JAR 2007»
13 years 7 months ago
Reasoning in Description Logics by a Reduction to Disjunctive Datalog
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
AUTOMATICA
2008
75views more  AUTOMATICA 2008»
13 years 7 months ago
Optimal complexity reduction of polyhedral piecewise affine systems
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...
Tobias Geyer, Fabio Danilo Torrisi, Manfred Morari
CLIMA
2004
13 years 9 months ago
Verifying Protocol Conformance for Logic-Based Communicating Agents
Communication plays a fundamental role in multi-agents systems. One of the main issues in the design of agent interaction protocols is the verification that a given protocol implem...
Matteo Baldoni, Cristina Baroglio, Alberto Martell...
ISMIS
2005
Springer
14 years 1 months ago
Flexible Pattern Discovery with (Extended) Disjunctive Logic Programming
Abstract. The post-genomic era showed up a wide range of new challenging issues for the areas of knowledge discovery and intelligent information management. Among them, the discove...
Luigi Palopoli, Simona E. Rombo, Giorgio Terracina
CSL
2008
Springer
13 years 9 months ago
On the Almighty Wand
We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify pr...
Rémi Brochenin, Stéphane Demri, &Eac...