Sciweavers

1686 search results - page 131 / 338
» Programs as polygraphs: computability and complexity
Sort
View
161
Voted
CADE
2001
Springer
16 years 3 months ago
A Top-Down Procedure for Disjunctive Well-Founded Semantics
Abstract. Skepticism is one of the most important semantic intuitions in artificial intelligence. The semantics formalizing skeptical reasoning in (disjunctive) logic programming i...
Kewen Wang
ICFP
2008
ACM
16 years 3 months ago
Pattern minimization problems over recursive data types
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
Alexander Krauss
CP
2007
Springer
15 years 9 months ago
Answer Set Optimization for and/or Composition of CP-Nets: A Security Scenario
Defence trees and CP-net (ceteris paribus network) are two useful approaches that can be used to help a system administrator to analyze a security scenario and to give him a model ...
Stefano Bistarelli, Pamela Peretti, Irina Trubitsy...
159
Voted
C3S2E
2008
ACM
15 years 4 months ago
Concurrent software engineering: preparing for paradigm shift
Software systems bridge the gap between information processing needs and available computer hardware. As system requirements grow in complexity and hardware evolves, the gap does ...
Peter Grogono, Brian Shearing
142
Voted
HCI
2009
15 years 1 months ago
Interactive Demonstration of Pointing Gestures for Virtual Trainers
Abstract. While interactive virtual humans are becoming widely used in education, training and delivery of instructions, building the animations required for such interactive chara...
Yazhou Huang, Marcelo Kallmann