Results 1  10
of
206,499
A SATbased polynomial space algorithm for answer set programming
 PROCEEDINGS OF THE TENTH INTERNATIONAL WORKSHOP ON NONMONOTONIC REASONING. (2004) 189–196
"... The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boost of SAT solvers during last years. Various translations from ASP to SAT are known but the resulting SAT formula either ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
SATBased decision procedure for answer set programming that (i) deals with any (non disjunctive) logic program, (ii) works on a SAT formula without additional variables, and (iii) is guaranteed to work in polynomial space. Further, our procedure can be extended to compute all the answer sets still
Satbased answer set programming
 In Proc. AAAI04
, 2004
"... The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boost of SAT solvers during last years. Various translations from ASP to SAT are known but the resulting SAT formula either ..."
Abstract

Cited by 43 (10 self)
 Add to MetaCart
SATbased decision procedure for answer set programming that (i) deals with any (non disjunctive) logic program, (ii) works on a SAT formula without additional variables, and (iii) is guaranteed to work in polynomial space. Further, our procedure can be extended to compute all the answer sets still
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 578 (50 self)
 Add to MetaCart
in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space. For this purpose, we introduce a calculus on computation trees over realnumbered time. Unfortunately
Large margin methods for structured and interdependent output variables
 JOURNAL OF MACHINE LEARNING RESEARCH
, 2005
"... Learning general functional dependencies between arbitrary input and output spaces is one of the key challenges in computational intelligence. While recent progress in machine learning has mainly focused on designing flexible and powerful input representations, this paper addresses the complementary ..."
Abstract

Cited by 624 (12 self)
 Add to MetaCart
the complementary issue of designing classification algorithms that can deal with more complex outputs, such as trees, sequences, or sets. More generally, we consider problems involving multiple dependent output variables, structured output spaces, and classification problems with class attributes. In order
Benchmarking Least Squares Support Vector Machine Classifiers
 NEURAL PROCESSING LETTERS
, 2001
"... In Support Vector Machines (SVMs), the solution of the classification problem is characterized by a (convex) quadratic programming (QP) problem. In a modified version of SVMs, called Least Squares SVM classifiers (LSSVMs), a least squares cost function is proposed so as to obtain a linear set of eq ..."
Abstract

Cited by 476 (46 self)
 Add to MetaCart
In Support Vector Machines (SVMs), the solution of the classification problem is characterized by a (convex) quadratic programming (QP) problem. In a modified version of SVMs, called Least Squares SVM classifiers (LSSVMs), a least squares cost function is proposed so as to obtain a linear set
Fast SATbased answer set solver
 In Proceedings of the Twentyfirst National Conference on Artificial Intelligence (AAAI’06
"... Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS are two wellknown such systems. They find an answer set from the full models for the completion of the input program, whic ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS are two wellknown such systems. They find an answer set from the full models for the completion of the input program
A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web
 IN PROC. KR2004
, 2004
"... Abstract. We present a novel combination of disjunctive logic programs under the answer set semantics with description logics for the Semantic Web. The combination is based on a wellbalanced interface between disjunctive logic programs and description logics, which guarantees the decidability of th ..."
Abstract

Cited by 288 (60 self)
 Add to MetaCart
Abstract. We present a novel combination of disjunctive logic programs under the answer set semantics with description logics for the Semantic Web. The combination is based on a wellbalanced interface between disjunctive logic programs and description logics, which guarantees the decidability
SATBased Explicit LTL Reasoning
"... Abstract. We present here a new explicit reasoning framework for linear temporal logic (LTL), which is built on top of propositional satisfiability (SAT) solving. As a proofofconcept of this framework, we describe a new LTL satisfiability algorithm. We implemented the algorithm in a tool, Aalta ..."
Abstract
 Add to MetaCart
Abstract. We present here a new explicit reasoning framework for linear temporal logic (LTL), which is built on top of propositional satisfiability (SAT) solving. As a proofofconcept of this framework, we describe a new LTL satisfiability algorithm. We implemented the algorithm in a tool
A SATBased Routing Algorithm for CrossReferencing
"... Abstract—CAD problems for microfluidic biochips have recently gained much attention. One critical issue is the droplet routing problem. On crossreferencing biochips, the routing problem requires an efficient way to tackle the complexity of simultaneous droplet routing, scheduling and voltage assign ..."
Abstract
 Add to MetaCart
demonstrate the efficiency and effectiveness of the proposed SATbased routing algorithm on a set of practical bioassays. I.
Results 1  10
of
206,499