The Stable Roommates problem with Ties and Incomplete lists (SRTI) is a matching problem characterized by the preferences of agents over other agents as roommates, where the preferences may have ties or be incomplete....
详细信息
The decoupling between the representation of a certain problem, i.e., its knowledge model, and the reasoning side is one of main strong points of model-based Artificial Intelligence (AI). This allows, e.g. to focus on...
详细信息
Learning from examples is an important branch of inductive learning, and is also the bottle-neck in concepts extraction of machine learning. Based on inductive learning theory, this paper applies combinatorial optimiz...
详细信息
ISBN:
(纸本)7312012035
Learning from examples is an important branch of inductive learning, and is also the bottle-neck in concepts extraction of machine learning. Based on inductive learning theory, this paper applies combinatorial optimization method to setup the programming models of learning concepts of the prepositional logic formulas in the conjunctive normal form (CNF) and disjunctive normal form (DNF). Then, genetic algorithms (GA), specified to CNF learning, is designed. GA can find the multiple optimal solution in theory and practice, and experiments reveal that it runs more efficiently compared with heuristic algorithms of the GS type.
A complete classification of the complexity of the local and global satisfiability problems for graded modal language over traditional classes of frames have already been established. By"traditional" classes...
详细信息
Answer Set programming (ASP) is a popular declarative programming language for solving hard combinatorial problems. Although ASP has gained widespread acceptance in academic and industrial contexts, there are certain ...
详细信息
Answer set programming (ASP) is a successful declarative formalism for knowledge representation and reasoning. The evaluation of ASP programs is nowadays based on the Conflict-Driven Clause Learning (CDCL) backtrackin...
详细信息
This paper introduces Presto, a symbolic partial evaluator for Maude’s rewriting logic theories that can improve system analysis and verification. In Presto, the automated optimization of a conditional rewrite theory...
详细信息
CASP is an extension of ASP that allows for numerical constraints to be added in the rules. PDDL+ is an extension of the PDDL standard language of automated planning for modeling mixed discrete-continuous dynamics. In...
详细信息
Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. It is often informally related to the field of satisfiabilitymodulo theories. Yet,...
详细信息
暂无评论