Sciweavers

378 search results - page 24 / 76
» Automating Mathematical Program Transformations
Sort
View
TPHOL
2003
IEEE
14 years 20 days ago
Program Extraction from Large Proof Developments
Abstract. It is well known that mathematical proofs often contain (abstract) algorithms, but although these algorithms can be understood by a human, it still takes a lot of time an...
Luís Cruz-Filipe, Bas Spitters
ASP
2001
Springer
13 years 12 months ago
Logic Programming Agents and Game Theory
In this paper we present a framework for logic programming agents to take part in games in such a way that stable models of the system, the ones agreed upon by all the members, co...
Marina De Vos, Dirk Vermeir
NMELP
1994
13 years 11 months ago
Computing Stable and Partial Stable Models of Extended Disjunctive Logic Programs
In Prz91], Przymusinski introduced the partial (or 3-valued) stable model semantics which extends the (2-valued) stable model semantics dened originally by Gelfond and Lifschitz G...
Carolina Ruiz, Jack Minker
ISORC
2009
IEEE
14 years 2 months ago
Fault-Tolerance for Component-Based Systems - An Automated Middleware Specialization Approach
General-purpose middleware, by definition, cannot readily support domain-specific semantics without significant manual efforts in specializing the middleware. This paper prese...
Sumant Tambe, Akshay Dabholkar, Aniruddha S. Gokha...
ECOOP
2000
Springer
13 years 11 months ago
Automated Test Case Generation from Dynamic Models
We have recently shown how use cases can be systematically transformed into UML state charts considering all relevant information from a use case specification, including pre- and ...
Peter Fröhlich, Johannes Link