Sciweavers

27119 search results - page 5036 / 5424
» Languages
Sort
View
JAIR
2010
111views more  JAIR 2010»
15 years 5 months ago
Grounding FO and FO(ID) with Bounds
Grounding is the task of reducing a first-order theory and finite domain to an equivalent propositional theory. It is used as preprocessing phase in many logic-based reasoning s...
Johan Wittocx, Maarten Mariën, Marc Denecker
JAPLL
2010
179views more  JAPLL 2010»
15 years 5 months ago
Tractable query answering and rewriting under description logic constraints
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
Héctor Pérez-Urbina, Boris Motik, Ia...
JBI
2010
129views Bioinformatics» more  JBI 2010»
15 years 5 months ago
Proclets in healthcare
Healthcare processes can be characterized as weakly-connected interacting lightweight workflows coping with different levels of granularity. Classical workflow notations are fal...
R. S. Mans, Nick C. Russell, Wil M. P. van der Aal...
JCSS
2010
111views more  JCSS 2010»
15 years 5 months ago
Reduction rules for reset/inhibitor nets
Abstract. Reset/inhibitor nets are Petri nets extended with reset arcs and inhibitor arcs. A reset arc allows a transition to remove all tokens from a certain place when the transi...
H. M. W. Verbeek, Moe Thandar Wynn, Wil M. P. van ...
JELIA
2010
Springer
15 years 5 months ago
Sets of Boolean Connectives That Make Argumentation Easier
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
Nadia Creignou, Johannes Schmidt, Michael Thomas, ...
« Prev « First page 5036 / 5424 Last » Next »