作者：
许进Department of Control Science and Engineering
Huazhong University of Science and Technology Wuhan 430074 China. new recursive vertex-deleting formula for the computation of the chromatic polynomial of a graph is obtained in this paper. This algorithm is not only a good tool for further studying chromatic polynomials but also the fastest among all the algorithms for the computation of chromatic polynomials.
A new recursive vertex-deleting formula for the computation of the chromatic polynomial of a graph is obtained in this paper. This algorithm is not only a good tool for further studying chromatic polynomials but also ...
详细信息
A new recursive vertex-deleting formula for the computation of the chromatic polynomial of a graph is obtained in this paper. This algorithm is not only a good tool for further studying chromatic polynomials but also the fastest among all the algorithms for the computation of chromatic polynomials.
A new methodology for developing theories of action has recently emerged which provides means for formally evaluating the correctness of such theories. Yet, for a theory of action to qualify as a solution to the frame...
详细信息
作者：
CD KoutrasS Zachos[A1]Graduate Program in Logic
Algorithms and Computation (MPLA) Department of Mathematics University of Athens 157 84 Zographou Greece E-mail: ckoutras@cc.ece.ntua.gr [A]Department of Electrical and Computer Engineering National Technical University of Athens 157 73 Zographou Greece E-mail: zachos@cc.ece.ntua.gr
In this paper, we contribute to a series of results on the family of many-valued modal logics which as been recently introduced by M. Fitting in [8, 9, 10, 12]. In this family, the underlying propositional logics empl...
详细信息
In this paper, we contribute to a series of results on the family of many-valued modal logics which as been recently introduced by M. Fitting in [8, 9, 10, 12]. In this family, the underlying propositional logics employ finite Heyting algebras for the space of truth values and the monotonic modal logics correspond to possible-worlds models with many-valued accessibility relations. There exist also modal non-monotonic counterparts in the McDermott & Doyle fashion. In [10], M. Fitting provided a many-valued generalization of Moore's autoepistemic logic and proved that, for logics with linear truth spaces, the important theorem of G. Schwarz for the equivalence of K45 and autoepistemic logic from [31], extends to the many-valued case. Here, we define and investigate a many-valued generalization of Schwarz's reflexive autoepistemic logic from [28] with an intended interpretation of □ as 'true and known'. We prove several interesting properties of many-valued reflexive expansions and show that - under the same linearity restriction - Schwarz's relevant theorem extends also in the many-valued setting, i.e., our many-valued reflexive autoepistemic logic coincides with many-valued non-monotonic Sw5.
We consider Bayesian and information-theoretic approaches for determining non-informative prior distributions in a parametric model family. The information-theoretic approaches are based on the recently modified defin...
详细信息
The two volume set LNCS 7491 and 7492 constitutes the refereed proceedings of the 12th International Conference on Parallel Problem Solving from Nature, PPSN 2012, held in Taormina, Sicily, Italy, in September 2012. T...
详细信息
ISBN:
(数字)9783642329371
ISBN:
(纸本)9783642329364
The two volume set LNCS 7491 and 7492 constitutes the refereed proceedings of the 12th International Conference on Parallel Problem Solving from Nature, PPSN 2012, held in Taormina, Sicily, Italy, in September 2012. The total of 105 revised full papers were carefully reviewed and selected from 226 submissions. The meeting began with 5 workshops which offered an ideal opportunity to explore specific topics in evolutionary computation, bio-inspired computing and metaheuristics. PPSN 2012 also included 8 tutorials. The papers are organized in topical sections on evolutionary computation; machine learning, classifier systems, image processing; experimental analysis, encoding, EDA, GP; multiobjective optimization; swarm intelligence, collective behavior, coevolution and robotics; memetic algorithms, hybridized techniques, meta and hyperheuristics; and applications.
The two volume set LNCS 7491 and 7492 constitutes the refereed proceedings of the 12th International Conference on Parallel Problem Solving from Nature, PPSN 2012, held in Taormina, Sicily, Italy, in September 2012. T...
详细信息
ISBN:
(数字)9783642329647
ISBN:
(纸本)9783642329630
The two volume set LNCS 7491 and 7492 constitutes the refereed proceedings of the 12th International Conference on Parallel Problem Solving from Nature, PPSN 2012, held in Taormina, Sicily, Italy, in September 2012. The total of 105 revised full papers were carefully reviewed and selected from 226 submissions. The meeting began with 6 workshops which offered an ideal opportunity to explore specific topics in evolutionary computation, bio-inspired computing and metaheuristics. PPSN 2012 also included 8 tutorials. The papers are organized in topical sections on evolutionary computation; machine learning, classifier systems, image processing; experimental analysis, encoding, EDA, GP; multiobjective optimization; swarm intelligence, collective behavior, coevolution and robotics; memetic algorithms, hybridized techniques, meta and hyperheuristics; and applications.
暂无评论