Sciweavers

70 search results - page 9 / 14
» Inferring acceptable arguments with Answer Set Programming
Sort
View
COMMA
2006
13 years 9 months ago
Semi-Stable Semantics
In this paper, we examine an argument-based semantics called semi-stable semantics. Semi-stable semantics is quite close to traditional stable semantics in the sense that every st...
Martin Caminada
ESOP
2004
Springer
13 years 11 months ago
ML-Like Inference for Classifiers
Environment classifiers were proposed as a new approach to typing multi-stage languages. Safety was established in the simply-typed and let-polymorphic settings. While the motivati...
Cristiano Calcagno, Eugenio Moggi, Walid Taha
ACL
2011
12 years 11 months ago
A Bayesian Model for Unsupervised Semantic Parsing
We propose a non-parametric Bayesian model for unsupervised semantic parsing. Following Poon and Domingos (2009), we consider a semantic parsing setting where the goal is to (1) d...
Ivan Titov, Alexandre Klementiev
DEXA
2005
Springer
110views Database» more  DEXA 2005»
14 years 1 months ago
Intensional Encapsulations of Database Subsets via Genetic Programming
Finding intensional encapsulations of database subsets is the inverse of query evaluation. Whereas query evaluation transforms an intensional expression (the query) to its extensi...
Aybar C. Acar, Amihai Motro
RTA
2010
Springer
13 years 11 months ago
Declarative Debugging of Missing Answers for Maude
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
Adrián Riesco, Alberto Verdejo, Narciso Mar...