95 search results - page 17 / 19 » Ordered completion for logic programs with aggregates |
IDEAS
2005
IEEE
14 years 1 months ago
2005
IEEE
Laboratory information systems (LIMS) are used in life science research to manage complex experiments. Since LIMS systems are often shared by different research groups, powerful a...
AAAI
2006
13 years 8 months ago
2006
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...
TPHOL
1999
IEEE
13 years 11 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
POPL
2007
ACM
14 years 7 months ago
2007
ACM
This paper proposes a lightweight fusion method for general recursive function definitions. Compared with existing proposals, our method has several significant practical features...
DAGSTUHL
2006
13 years 8 months ago
2006
This paper presents novel language and analysis techniques that significantly speed up software model checking of data structure properties. Consider checking a red-black tree imp...