jArgSemSAT is a Java re-implementation of ArgSemSAT—a SATbased solver for abstract argumentation problems—that can be easily integrated in existing argumentation systems (1) as an off-the-shelf, standalone, library; (2) as a Tweety compatible library; and (3) as a fast and robust web service freely available on the Web. Despite being written in Java, jArgSemSAT is very efficient.

A reduction converts a solver for one problem into a solver for another problem. We discuss and analyze reductions which automatically convert classi cation solvers into solvers for other supervised learning problems.

A diagrammatic problem-solver requires a library of visual routines (VRs) and action routines (ARs) the VRs are used to obtain information of specified types from the diagram and ARs to modify the diagram in specified ways. The VRs/ARs required are unbounded a new domain may call for new perceptions and actions. We report on progress on our research in building an automated VR/AR synthesis syst...

We introduce SAT(ID) and explain its relation both to SAT and to ASP. We then describe the SAT(ID) solver MidL. We outline its design and algorithms, and finally establish its performance by experiment.

Goals • Address some changes that have taken place in AI research in last 20 years Changes that have to do with move from programs to solvers Problem =⇒ Solver =⇒ Solution Solvers are general programs whose scope defined in terms of a model Challenge is computational: how to make the solvers scale up • Explain its relevance to the old AI goals concerning general intelligence and human cognition

In this paper, based on the analyzing of the selecting and distinguishing characteristics of cognitive thinking, the product design elements are analyzed with the theories of Kansei Engineering, and the corresponding mathematic model for the analysis is developed based on the quantification-I theory to quantitatively discuss the relationship between product form design elements and the psycholo...

This is the user manual for the software package BSEPACK (Bethe--Salpeter Eigenvalue Solver Package).

The strike force asset allocation problem consists of grouping strike force assets into packages and assigning these packages to targets and defensive assets in a way that maximizes the strike force potential. Integer programming formulations are developed, semi-real and random problems are built up, and computational results via the CPLEX MIP Solver are presented.

In this paper, we construct a general model of diverse problem solvers of limited abilities. We use this model to derive two main results: (1) a collection of diverse, bounded problem solvers can locate optimal solutions to difficult problems and (2) a collection of problem solvers of diverse abilities tends to jointly outperform a collection of high ability problem solvers, where a problem sol...