3481 search results - page 627 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
125
Voted
CADE
2007
Springer
16 years 3 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
137
click to vote
OOPSLA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Object-oriented language concepts have been highly successful, resulting in a large number of object-oriented languages and language extensions. Unfortunately, formal met...
204
Voted
FCCM
2006
IEEE
15 years 8 months ago
2006
IEEE
Current Radio Frequency Identification (RFID) systems generally have long design times and low tolerance to changes in specification. This paper describes a field programmable,...
145
Voted
KBSE
2005
IEEE
15 years 8 months ago
2005
IEEE
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...
123
Voted
ECML
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Learning from multi-relational domains has gained increasing attention over the past few years. Inductive logic programming (ILP) systems, which often rely on hill-climbi...