Sciweavers

2905 search results - page 184 / 581
» Formal Memetic Algorithms
Sort
View
FM
2008
Springer
93views Formal Methods» more  FM 2008»
13 years 12 months ago
Finding Minimal Unsatisfiable Cores of Declarative Specifications
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checki...
Emina Torlak, Felix Sheng-Ho Chang, Daniel Jackson
FMCAD
2008
Springer
13 years 12 months ago
Automatic Generation of Local Repairs for Boolean Programs
Automatic techniques for software verification focus on obtaining witnesses of program failure. Such counterexamples often fail to localize the precise cause of an error and usuall...
Roopsha Samanta, Jyotirmoy V. Deshmukh, E. Allen E...
EMNLP
2008
13 years 11 months ago
A Generative Model for Parsing Natural Language to Meaning Representations
In this paper, we present an algorithm for learning a generative model of natural language sentences together with their formal meaning representations with hierarchical structure...
Wei Lu, Hwee Tou Ng, Wee Sun Lee, Luke S. Zettlemo...
IJCAI
2007
13 years 11 months ago
Average-Reward Decentralized Markov Decision Processes
Formal analysis of decentralized decision making has become a thriving research area in recent years, producing a number of multi-agent extensions of Markov decision processes. Wh...
Marek Petrik, Shlomo Zilberstein
ACL
2001
13 years 11 months ago
Extending Lambek Grammars: a Logical Account of Minimalist Grammars
We provide a logical definition of Minimalist grammars, that are Stabler's formalization of Chomsky's minimalist program. Our logical definition leads to a neat relation...
Alain Lecomte, Christian Retoré