Sciweavers

599 search results - page 71 / 120
» Integrating answer set programming and constraint logic prog...
Sort
View
143
Voted
CADE
2010
Springer
15 years 4 months ago
A Slice-Based Decision Procedure for Type-Based Partial Orders
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...
Elena Sherman, Brady J. Garvin, Matthew B. Dwyer
136
Voted
FLOPS
1999
Springer
15 years 7 months ago
Using Types as Approximations for Type Checking Prolog Programs
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
Christoph Beierle, Gregor Meyer
112
Voted
FLAIRS
2004
15 years 5 months ago
Constraint Processing with Reactive Agents
The integration of methods of Constraint Programming and Multi-Agent-Systems is discussed in this paper. We describe different agent topologies for Constraint Satisfaction Problem...
Georg Ringwelski, Richard J. Wallace
255
Voted
EH
1999
IEEE
351views Hardware» more  EH 1999»
15 years 7 months ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...
120
Voted
PASTE
2004
ACM
15 years 9 months ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick