Sciweavers

620 search results - page 59 / 124
» About the logical relations between cases and rules
Sort
View
CORR
2006
Springer
119views Education» more  CORR 2006»
15 years 6 months ago
Calculating modules in contextual logic program refinement
The refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specificat...
Robert Colvin, Ian J. Hayes, Paul A. Strooper
EACL
2003
ACL Anthology
15 years 7 months ago
Topological Parsing
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
Gerald Penn, Mohammad Haji-Abdolhosseini
ICCS
2007
Springer
16 years 13 days ago
AIMSS: An Architecture for Data Driven Simulations in the Social Sciences
Abstract. This paper presents a prototype implementation of an intelligent assistance architecture for data-driven simulation specialising in qualitative data in the social science...
Catriona Kennedy, Georgios K. Theodoropoulos, Volk...
AICT
2010
IEEE
216views Communications» more  AICT 2010»
14 years 10 months ago
A Simplified Method for Optimising Sequentially Processed Access Control Lists
Among the various options for implementing Internet packet filters in the form of Access Control Lists (ACLs), is the intuitive – but potentially crude – method of processing t...
Vic Grout, John Davies
COLING
1996
15 years 7 months ago
Interpretation of Nominal Compounds: Combining Domain-Independent and Domain-Specific Information
A domain independent model is proposed for the automated interpretation of nominal compounds in English. This model is meant to account for productive rules of interpretation whic...
Cécile Fabre