Sciweavers

3385 search results - page 519 / 677
» Language, Logic, and the Brain
Sort
View
JELIA
2010
Springer
15 years 4 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, ...
RULEML
2010
Springer
15 years 4 months ago
Transformation of SBVR Compliant Business Rules to Executable FCL Rules
 The  main  source  of  changing  requirements  of  the  dynamic  business   environment  is  response  to  changes  in  regulations  and  contracts  towards  ...
Aqueo Kamada, Guido Governatori, Shazia Wasim Sadi...
SAT
2010
Springer
174views Hardware» more  SAT 2010»
15 years 4 months ago
A System for Solving Constraint Satisfaction Problems with SMT
Abstract. SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vect...
Miquel Bofill, Josep Suy, Mateu Villaret
SEMWEB
2010
Springer
15 years 4 months ago
Experience of Using OWL Ontologies for Automated Inference of Routine Pre-operative Screening Tests
We describe our experience of designing and implementing a knowledge-based pre-operative assessment decision support system. We developed the system using semantic web technology, ...
Matt-Mouley Bouamrane, Alan L. Rector, Martin Hurr...
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 3 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker