Sciweavers

481 search results - page 30 / 97
» Executing Higher Order Logic
Sort
View
SYNASC
2008
IEEE
274views Algorithms» more  SYNASC 2008»
14 years 4 months ago
Verbalising R2ML Rules into SBVR
Nowadays, business rules receive a lot of attention from both industry and academia, as they are considered the ideal vehicle for capturing business logic. The purpose of our pape...
Oana Nicolae, Gerd Wagner
TPHOL
1992
IEEE
14 years 1 months ago
The HOL Logic Extended with Quantification over Type Variables
The HOL system is an LCF-style mechanized proof-assistant for conducting proofs in higher order logic. This paper discusses a proposal to extend the primitive basis of the logic un...
Thomas F. Melham
ICFP
2007
ACM
14 years 1 months ago
iTasks: executable specifications of interactive work flow systems for the web
In this paper we introduce the iTask system: a set of combinators to specify work flows in a pure functional language at a very high level of abstraction. Work flow systems are au...
Rinus Plasmeijer, Peter Achten, Pieter W. M. Koopm...
CSCLP
2005
Springer
14 years 3 months ago
Complete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains
We give an efficiently executable specification of the global constraint of lexicographic order in the Constraint Handling Rules (CHR) language. In contrast to previous approaches...
Thom W. Frühwirth
FOIKS
2008
Springer
13 years 11 months ago
Defeasible Reasoning and Partial Order Planning
Abstract. Argumentation-based formalisms provide a way of considering the defeasible nature of reasoning with partial and often erroneous knowledge in a given environment. This pro...
Diego R. García, Alejandro Javier Garc&iacu...