Sciweavers

308 search results - page 49 / 62
» Answer Set Programming Based on Propositional Satisfiability
Sort
View
SIGCSE
2004
ACM
140views Education» more  SIGCSE 2004»
14 years 1 months ago
CFX: finding just the right examples for CS1
Finding just the right example to answer a question can be difficult for CS1 students and teachers. For this to work well there must be an intuitive interface coupled to an approp...
Dale Reed, Sam John, Ryan Aviles, Feihong Hsu
VMCAI
2010
Springer
14 years 4 months ago
Building a Calculus of Data Structures
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
Viktor Kuncak, Ruzica Piskac, Philippe Suter, Thom...
IJKSR
2011
106views more  IJKSR 2011»
12 years 11 months ago
Integrating the LMS in Service Oriented eLearning Systems
Learning management systems are routinely used for presenting, solving and grading exercises with large classes. However, teachers are constrained to use questions with pre-defined...
José Paulo Leal, Ricardo Queirós
SEMWEB
2010
Springer
13 years 5 months ago
Declarative Semantics for the Rule Interchange Format Production Rule Dialect
Abstract. The Rule Interchange Format Production Rule Dialect (RIFPRD) is a W3C Recommendation to define production rules for the Semantic Web, whose semantics is defined operation...
Carlos Viegas Damásio, José Jú...
CDC
2010
IEEE
155views Control Systems» more  CDC 2010»
13 years 2 months ago
Relaxing LMI domination matricially
Given linear matrix inequalities (LMIs) L1 and L2 in the same number of variables it is natural to ask: (Q1) does one dominate the other, that is, does L1(X) 0 imply L2(X) 0? (Q2) ...
J. William Helton, Igor Klep, Scott A. McCullough