Sciweavers

572 search results - page 74 / 115
» Functional Test Generation using Constraint Logic Programmin...
Sort
View
MPC
2010
Springer
165views Mathematics» more  MPC 2010»
14 years 14 days ago
Dependently Typed Grammars
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
Kasper Brink, Stefan Holdermans, Andres Löh
AAMAS
1999
Springer
13 years 7 months ago
Verifying Compliance with Commitment Protocols
Interaction protocols are specific, often standard, constraints on the behaviors of autonomous agents in a multiagent system. Protocols are essential to the functioning of open sys...
Mahadevan Venkatraman, Munindar P. Singh
ICML
2008
IEEE
14 years 8 months ago
Fast estimation of first-order clause coverage through randomization and maximum likelihood
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
Filip Zelezný, Ondrej Kuzelka
ICTAI
2007
IEEE
14 years 2 months ago
Establishing Logical Rules from Empirical Data
We review a method of generating logical rules, or axioms, from empirical data. This method, using closed set properties of formal concept analysis, has been previously described ...
John L. Pfaltz
FLAIRS
2004
13 years 9 months ago
Backcalculation of Airport Flexible Pavement Non-Linear Moduli Using Artificial Neural Networks
The Heavy Weight Deflectometer (HWD) test is one of the most widely used tests for assessing the structural integrity of airport pavements in a non-destructive manner. The elastic...
Kasthurirangan Gopalakrishnan, Marshall R. Thompso...