Results 1  10
of
656
Solving multiclass learning problems via errorcorrecting output codes
 JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH
, 1995
"... Multiclass learning problems involve nding a de nition for an unknown function f(x) whose range is a discrete set containing k>2values (i.e., k \classes"). The de nition is acquired by studying collections of training examples of the form hx i;f(x i)i. Existing approaches to multiclass l ..."
Abstract

Cited by 726 (8 self)
 Add to MetaCart
Multiclass learning problems involve nding a de nition for an unknown function f(x) whose range is a discrete set containing k>2values (i.e., k \classes"). The de nition is acquired by studying collections of training examples of the form hx i;f(x i)i. Existing approaches to multiclass
Answer Set Planning
"... In "answer set programming," solutions to a problem are represented by answer sets, and not by answer substitutions produced in response to a query, as in conventional logic programming. Instead of Prolog, answer set programming uses software systems capable of computing answer sets. This ..."
Abstract

Cited by 171 (6 self)
 Add to MetaCart
In "answer set programming," solutions to a problem are represented by answer sets, and not by answer substitutions produced in response to a query, as in conventional logic programming. Instead of Prolog, answer set programming uses software systems capable of computing answer sets
Application of theorem proving to problem solving
, 1969
"... This paper shows how an extension of the resolution proof procedure can be used to construct problem solutions. The extended proof procedure can solve problems involving state transformations. The paper explores several alternate problem representations and provides a discussion of solutions to samp ..."
Abstract

Cited by 264 (1 self)
 Add to MetaCart
set of axioms by the resolution proof procedure, then the extended proof procedure will find or construct an x that satisfies P(x). This earlier paper (1) showed how one can axiomatize simple questionanswering subjects, (2) described a questionanswering program called QA2 based on this procedure
The first answer set programming system competition
 Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2007, LNAI
, 2007
"... Abstract. This paper gives a summary of the First Answer Set Programming System Competition that was held in conjunction with the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning. The aims of the competition were twofold: first, to collect challenging benchmark problems ..."
Abstract

Cited by 46 (9 self)
 Add to MetaCart
Abstract. This paper gives a summary of the First Answer Set Programming System Competition that was held in conjunction with the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning. The aims of the competition were twofold: first, to collect challenging benchmark
Conference Paper Assignment Problem
, 2009
"... Conference paper assignment—the task of assigning paper submissions to reviewers—is a key step in the management and smooth functioning of conferences. We study this problem as an application of recommender systems research. Besides the traditional goal of predicting ‘who likes what?’, a conference ..."
Abstract
 Add to MetaCart
Conference paper assignment—the task of assigning paper submissions to reviewers—is a key step in the management and smooth functioning of conferences. We study this problem as an application of recommender systems research. Besides the traditional goal of predicting ‘who likes what?’, a conference
Control Flow Analysis in Scheme
, 1988
"... Traditional flow analysis techniques, such as the ones typically employed by optimising Fortran compilers, do not work for Schemelike languages. This paper presents a flow analysis technique control flow analysis which is applicable to Schemelike languages. As a demonstration application, the in ..."
Abstract

Cited by 231 (7 self)
 Add to MetaCart
, the information gathered by control flow analysis is used to perform a traditional flow analysis problem, induction variable elimination. Extensions and limitations are discussed. The techniques presented in this paper are backed up by working code. They are applicable not only to Scheme, but also to related
The Second Answer Set Programming Competition
"... Abstract. This paper reports on the Second Answer Set Programming Competition. The competitions in areas of Satisfiability checking, PseudoBoolean constraint solving and Quantified Boolean Formula evaluation have proven to be a strong driving force for a community to develop better performing syste ..."
Abstract

Cited by 48 (12 self)
 Add to MetaCart
Abstract. This paper reports on the Second Answer Set Programming Competition. The competitions in areas of Satisfiability checking, PseudoBoolean constraint solving and Quantified Boolean Formula evaluation have proven to be a strong driving force for a community to develop better performing
Extensions of Answer Set Programming
"... This paper describes a doctoral research in three areas: Hybrid ASP – an extension of Answer Set Programming for reasoning about dynamical systems, an extension of Set Constraint atoms for reasoning about preferences, computing stable models of logic programs using Metropolis type algorithms. The pa ..."
Abstract
 Add to MetaCart
This paper describes a doctoral research in three areas: Hybrid ASP – an extension of Answer Set Programming for reasoning about dynamical systems, an extension of Set Constraint atoms for reasoning about preferences, computing stable models of logic programs using Metropolis type algorithms
Answer set programming based on propositional satisfiability
 Journal of Automated Reasoning, 36:345–377, Gelfond
"... Abstract. Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the availability of efficient solvers for propositional satisfiability (SAT), various reductions from logic pro ..."
Abstract

Cited by 63 (9 self)
 Add to MetaCart
Abstract. Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the availability of efficient solvers for propositional satisfiability (SAT), various reductions from logic
Representing Constraint Satisfaction Problems in Answer Set Programming
 In: ICLP09 Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP09).(2009
"... Abstract In this paper we describe an approach for integrating answer set programming (ASP) and constraint programming, in which ASP is viewed as a specification language for constraint satisfaction problems. ASP programs are written in such a way that their answer sets encode the desired constraint ..."
Abstract

Cited by 23 (8 self)
 Add to MetaCart
Abstract In this paper we describe an approach for integrating answer set programming (ASP) and constraint programming, in which ASP is viewed as a specification language for constraint satisfaction problems. ASP programs are written in such a way that their answer sets encode the desired
Results 1  10
of
656