Sciweavers

580 search results - page 75 / 116
» On the Foundations of Answer Set Programming
Sort
View
JAR
2007
142views more  JAR 2007»
13 years 8 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
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
14 years 21 days ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
OOPSLA
2005
Springer
14 years 2 months ago
Relational queries over program traces
Instrumenting programs with code to monitor runtime behavior is a common technique for profiling and debugging. In practice, instrumentation is either inserted manually by progra...
Simon Goldsmith, Robert O'Callahan, Alexander Aike...
DAC
2003
ACM
14 years 9 months ago
Behavioral consistency of C and verilog programs using bounded model checking
We present an algorithm that checks behavioral consistency between an ANSI-C program and a circuit given in Verilog using Bounded Model Checking. Both the circuit and the program ...
Edmund M. Clarke, Daniel Kroening, Karen Yorav
SIGCSE
2000
ACM
453views Education» more  SIGCSE 2000»
14 years 1 months ago
Aristotle and object-oriented programming: why modern students need traditional logic
Classifying is a central activity in object-oriented programming and distinguishes it from procedural programming. Traditional logic, initiated by Aristotle, assigns classificatio...
Derek Rayside, Gerard T. Campbell