Enumerating All Subgraphs Under Given Constraints Using Zero-Suppressed Sentential Decision Diagrams

Subgraph enumeration is a fundamental task in computer science. Since the number of subgraphs can be large, some enumeration algorithms exploit compressed representations for efficiency. One such representation is the Zero-suppressed Binary Decision Diagram (ZDD). ZDDs can represent the set of subgraphs compactly and support several poly-time queries, such as counting and random sampling. Researchers have proposed efficient algorithms to construct ZDDs representing the set of subgraphs under several constraints, which yield fruitful results in many applications. Recently, Zero-suppressed Sentential Decision Diagrams (ZSDDs) have been proposed as variants of ZDDs. ZSDDs can be smaller than ZDDs when representing the same set of subgraphs. However, efficient algorithms to construct ZSDDs are known only for specific types of subgraphs: matchings and paths. We propose a novel framework to construct ZSDDs representing sets of subgraphs under given constraints. Using our framework, we can construct ZSDDs representing several sets of subgraphs such as matchings, paths, cycles, and spanning trees. We show the bound of sizes of constructed ZSDDs by the branch-width of the input graph, which is smaller than that of ZDDs by the path-width. Experiments show that our methods can construct ZSDDs faster than ZDDs and that the constructed ZSDDs are smaller than ZDDs when representing the same set of subgraphs

A Circuit-Based Approach to Efficient Enumeration

We study the problem of enumerating the satisfying valuations of a circuit while bounding the delay, i.e., the time needed to compute each successive valuation. We focus on the class of structured d-DNNF circuits originally introduced in knowledge compilation, a sub-area of artificial intelligence. We propose an algorithm for these circuits that enumerates valuations with linear preprocessing and delay linear in the Hamming weight of each valuation. Moreover, valuations of constant Hamming weight can be enumerated with linear preprocessing and constant delay. Our results yield a framework for efficient enumeration that applies to all problems whose solutions can be compiled to structured d-DNNFs. In particular, we use it to recapture classical results in database theory, for factorized database representations and for MSO evaluation. This gives an independent proof of constant-delay enumeration for MSO formulae with first-order free variables on bounded-treewidth structures

Optimized Framework based on Rough Set Theory for Big Data Pre-processing in Certain and Imprecise Contexts” -- Marie Sklodowska-Curie Project: Open Problems’

Peer reviewe

決定グラフを用いた暗黙的グラフ列挙に関する研究

京都大学新制・課程博士博士(情報学)甲第23548号情博第778号新制||情||132(附属図書館)京都大学大学院情報学研究科通信情報システム専攻(主査)教授 湊 真一, 教授 山本 章博, 准教授 川原 純学位規則第4条第1項該当Doctor of InformaticsKyoto UniversityDFA

Analytical reasoning with multiple external representations

This thesis presents work on analytical reasoning with external representations (ERs) using problems similar to those used in the US GRE college-entrance examination. The work investigates the factors associated with effective ER use in situations where subjects select, construct and reason with their own ERs. Practically all previous work has tended to focus solely upon performance rather than process. In this thesis the emphasis is upon cognitive processes during the entire time-course of reasoning with ERs, from problem comprehension through to answer selection. A background to the work is provided by 2 comprehensive reviews of: 1.) previous research on ERs and reasoning and 2.) the cognitive and semantic properties of ERs. Results from three empirical studies are reported. The first study examined a large corpus of 'workscratchings' produced by subjects as they solved paper and pencil-based analytical reasoning problems under test conditions. The workscratching ERs showed great diversity between and within subjects and across a range of problems. They included lists, various kinds of table, set diagrams, node and arc diagrams, first-order and propositioned logic, plans and natural language. It is shown that problem-solving performance is related to the type of ER used in the solution. The second study utilised a computer-based system (switchERI). The system administered analytical reasoning problems and provided a. range of ER construction environments for the subject to choose and switch between. User-system interactions were recorded dynamically during problem solving. This methodology permitted microanalyses of the cognitive events at each stage during the time-course of problem solving. A process account of analytical reasoning with ERs is developed in which five major stages are identified - problem comprehension, ER selection, ER construction, read-off from the ER and answer selection/responding. A range of common slips and misconceptions are identified at each stage. The results show, inter alia, that subjects whose responses are consistent with their ERs perform better than subjects whose responses are inconsistent with their ERs even if the ER is partially incorrect. The data from the workscratching analysis and switchERI study informed the design of' switchERII, a second system. SwitchERII incorporates a. representation of the semantics of Euler's Circles, dynamically parses the user's representation and provides feedback and advice. A third study was conducted with the switchERII system. Few, if any, studies to date have attempted to relate subjects' prior knowledge of ER formalisms to their reasoning performance. Subjects' prior knowledge of ER formalisms was assessed in both switchER studies. It was observed that subjects' performance on representation interpretation tasks does not necessarily predict their performance in conditions where they select and construct their own representations. The reasons for the decoupling are discussed. Data from all three studies show that subjects often utilise multiple representations in their solutions, either concurrently or serially via. ER switching. Two distinctly different types of switching were observed. One kind ('thrashing') is associated with poorer performance and reflects less comprehensive prior knowledge, inability to select au appropriate ER and hazy problem comprehension. Judicious switching, on the other hand, is associated with high levels of problem comprehension and skilled matching of the ERs' properties to changing task demands. It is claimed that effective reasoning with ERs involves complex interactions between at least three factors: (a.) within-subject variables such as the subject's representational repertoire (prior knowledge) and representational modality preferences (cognitive style); (b.) skill at overcoming a variety of barriers to comprehension and an ability to discern the salient attributes and characteristics of different problem types and (c.) an understanding of the semantic and cognitive properties of graphical and non-graphical ERs coupled with an ability to match those properties to the problem's task demands. It is suggested that the role of externalisation in reasoning with ERs may be to facilitate the swapping of information between cognitive subsystems. A mechanism by which the use of diagrammatic ERs may facilitate self-explanation is also proposed. The thesis concludes with an argument in favour of a domain-independent 'ER curriculum'. It is suggested that direct instruction in the use of a range of ERs might equip students with wider representational repertoires and hence allow them more scope to indulge their representational preferences. Finally, several directions for future work are proposed. These include extending the representational semantics of switchERII, evaluating various types of system feedback and implementing a mechanism for checking for slips during read-off from ERs

Communication and content

Communication and content presents a comprehensive and foundational account of meaning based on new versions of situation theory and game theory. The literal and implied meanings of an utterance are derived from first principles assuming little more than the partial rationality of interacting agents. New analyses of a number of diverse phenomena – a wide notion of ambiguity and content encompassing phonetics, syntax, semantics, pragmatics, and beyond, vagueness, convention and conventional meaning, indeterminacy, universality, the role of truth in communication, semantic change, translation, Frege’s puzzle of informative identities – are developed. Communication, speaker meaning, and reference are defined. Frege’s context and compositional principles are generalized and reconciled in a fixed-point principle, and a detailed critique of Grice, several aspects of Lewis, and some aspects of the Romantic conception of meaning are offered