Sciweavers

756 search results - page 95 / 152
» Can Abstract State Machines Be Useful in Language Theory
Sort
View
JAIR
2010
131views more  JAIR 2010»
13 years 6 months ago
Automatic Induction of Bellman-Error Features for Probabilistic Planning
Domain-specific features are important in representing problem structure throughout machine learning and decision-theoretic planning. In planning, once state features are provide...
Jia-Hong Wu, Robert Givan
BSL
2004
110views more  BSL 2004»
13 years 8 months ago
Notes on quasiminimality and excellence
This paper ties together much of the model theory of the last 50 years. Shelah's attempts to generalize the Morley theorem beyond first order logic led to the notion of excel...
John T. Baldwin
APL
1993
ACM
14 years 7 days ago
The Role of APL and J in High-Performance Computation
Although multicomputers are becoming feasible for solving large problems, they are difficult to program: Extraction of parallelism from scalar languages is possible, but limited....
Robert Bernecky
SAT
2010
Springer
174views Hardware» more  SAT 2010»
13 years 6 months ago
A System for Solving Constraint Satisfaction Problems with SMT
Abstract. SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vect...
Miquel Bofill, Josep Suy, Mateu Villaret
AAMAS
2007
Springer
13 years 8 months ago
Conversational semantics sustained by commitments
We propose an operational model that combines message meaning and conversational structure in one comprehensive approach. Our long-term research goal is to lay down principles unit...
Roberto A. Flores, Philippe Pasquier, Brahim Chaib...