Sciweavers

360 search results - page 46 / 72
» Hybrid Branching-Time Logics
Sort
View
AGI
2008
14 years 11 months ago
Comirit: Commonsense Reasoning by Integrating Simulation and Logic
Rich computer simulations or quantitative models can enable an agent to realistically predict real-world behavior with precision and performance that is difficult to emulate in log...
Benjamin Johnston, Mary-Anne Williams
DLOG
2006
14 years 11 months ago
Conjunctive Query Answering for Description Logics with Transitive Roles
An important reasoning task, in addition to the standard DL reasoning services, is conjunctive query answering. In this paper, we present algorithms for conjunctive query answerin...
Birte Glimm, Ian Horrocks, Ulrike Sattler
CMSB
2007
Springer
15 years 4 months ago
Context Sensitivity in Logical Modeling with Time Delays
For modeling and analyzing regulatory networks based on qualitative information and possibly additional temporal constraints, approaches using hybrid automata can be very helpful. ...
Heike Siebert, Alexander Bockmayr
JAPLL
2010
131views more  JAPLL 2010»
14 years 8 months ago
Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule...
Willem Conradie, Valentin Goranko, Dimiter Vakarel...
CP
2009
Springer
15 years 10 months ago
Solving a Location-Allocation Problem with Logic-Based Benders' Decomposition
Abstract. We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capaci...
Mohammad M. Fazel-Zarandi, J. Christopher Beck