42 search results - page 4 / 9 » Specialising Finite Domain Programs Using Polyhedra |
LPAR
2001
Springer
15 years 1 months ago
2001
Springer
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
153
click to vote
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
COLING
2002
14 years 9 months ago
2002
Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon...
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
Message Sequence Charts (MSCs) are an attractive visual formalism widely used to capture system requirements during the early design stages in domains such as telecommunication sof...
ICLP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Action description languages, such as A and B [6], are expressive instruments introduced for formalizing planning domains and problems. The paper starts by proposing a me...