Sciweavers

1026 search results - page 53 / 206
» A Methodology for Equational Reasoning
Sort
View
LICS
1991
IEEE
14 years 24 days ago
Higher-Order Critical Pairs
Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for firing rules,...
Tobias Nipkow
AAAI
2008
13 years 11 months ago
Abductive Logic Programming by Nonground Rewrite Systems
Logic programming with negation offers a compelling approach to abductive reasoning. This paper shows a simple view of abduction in this context for the completion semantics, unde...
Fangzhen Lin, Jia-Huai You
CADE
2008
Springer
13 years 11 months ago
Aligator: A Mathematica Package for Invariant Generation (System Description)
We describe the new software package Aligator for automatically inferring polynomial loop invariants. The package combines algorithms from symbolic summation and polynomial algebra...
Laura Kovács
LPAR
2010
Springer
13 years 7 months ago
Qex: Symbolic SQL Query Explorer
We describe a technique and a tool called Qex for generating input tables and parameter values for a given parameterized SQL query. The evaluation semantics of an SQL query is tra...
Margus Veanes, Nikolai Tillmann, Jonathan de Halle...
IJIIDS
2011
72views more  IJIIDS 2011»
13 years 21 days ago
An agent model integrating an adaptive model for environmental dynamics
The environments in which agents are used often may be described by dynamical models, for example in the form of a set of differential equations. In this paper an agent model is pr...
Jan Treur, Muhammad Umair