Sciweavers

977 search results - page 85 / 196
» Logic programming with infinite sets
Sort
View
116
Voted
ECAI
2010
Springer
15 years 1 months ago
Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...
Davide Bresolin, Dario Della Monica, Valentin Gora...
AAAI
2006
15 years 1 months ago
Fast SAT-based Answer Set Solver
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
Zhijun Lin, Yuanlin Zhang, Hector Hernandez
76
Voted
ICLP
1999
Springer
15 years 4 months ago
CLAIRE: Combining Sets, Search, and Rules to Better Express Algorithms
This paper presents a programming language that includes paradigms that are usually associated with declarative languages, such as sets, rules and search, into an imperative (funct...
Yves Caseau, François-Xavier Josset, Fran&c...
124
Voted
CC
1998
Springer
134views System Software» more  CC 1998»
15 years 4 months ago
Flow Logics for Constraint Based Analysis
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...
Hanne Riis Nielson, Flemming Nielson
96
Voted
ISORC
2007
IEEE
15 years 6 months ago
Experiences from Applying WCET Analysis in Industrial Settings
Knowing the program timing characteristics is fundamental to the successful design and execution of real-time systems. Today, measurement-based timing analysis tools such as in-ci...
Jan Gustafsson, Andreas Ermedahl