In this article, we define a new variant of Cai-Furer-Immerman construction. With this construction and some conditions of Dawar and Richerby, we are able to show that inflationary fixed point logic with counting (IFP...
详细信息
ISBN:
(纸本)9783642022692
In this article, we define a new variant of Cai-Furer-Immerman construction. With this construction and some conditions of Dawar and Richerby, we are able to show that inflationary fixed point logic with counting (IFP+C) does not capture PTIME on the class of balanced graphs.
LIFE is an experimental programming language proposing to integrate logicprogramming, functional programming, and object-oriented programming. It replaces first-order terms with ψ-terms, data structures which allow ...
详细信息
Answer Set programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called "tight", the main search procedures use...
详细信息
Answer Set programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called "tight", the main search procedures used by ASP and SAT systems are equivalent, i.e., that they explore search trees with the same branching nodes. In this paper, we focus on the experimental evaluation of different search strategies, heuristics and their combinations that have been shown to be effective in the SAT community, in ASP systems. Our results show that, despite the strong link between ASP and SAT, it is not always the case that search strategies, heuristics and/or their combinations that currently dominate in SAT are also bound to dominate in ASP. We provide a detailed experimental evaluation for this phenomenon and we shed light on future development of efficient Answer Set solvers.
The proceedings contain 11 papers. The topics discussed include: publishing linked sensor data;semantics-based plug-and-play configuration of sensor network services;using SCXML for semantic sensor networks;linking se...
The proceedings contain 11 papers. The topics discussed include: publishing linked sensor data;semantics-based plug-and-play configuration of sensor network services;using SCXML for semantic sensor networks;linking sensor data - why, to what, and how?;the stimulus-sensor-observation ontology design pattern and its integration into the semantic sensor network ontology;bridging the gap between semantic web and networked sensors;short paper: semantic sensor composition;position paper: ontological logicprogramming;developing registries for the semantic sensor web using strdF and stSPARQL;challenges in linked stream data processing;and a contextualized cognitive perspective for linked sensor data.
We define the stable semantics for general hypothetical logic programs. We consider resolving a hypothetical goal (G ∶ R) in a context P as consisting of two steps: (i) Updating the context by inserting the clauses i...
详细信息
This paper attempts to improve our understanding of timed languages and their relation to timed automata. We start by giving a constructive proof of the folk theorem stating that timed languages specified by the past ...
详细信息
ISBN:
(纸本)3540309462
This paper attempts to improve our understanding of timed languages and their relation to timed automata. We start by giving a constructive proof of the folk theorem stating that timed languages specified by the past fragment of MITL, can be accepted by deterministic timed automata. On the other hand we provide a proof that certain languages expressed in the future fragment Of MITL arc not deterministic,(1) and analyze the reason for this asymmetry.
Teaching computer science and particularly programming in the curriculum of a mechanical engineering bachelor poses a difficult task due to motivational factors of the students. In this paper we describe the measures ...
详细信息
Teaching computer science and particularly programming in the curriculum of a mechanical engineering bachelor poses a difficult task due to motivational factors of the students. In this paper we describe the measures we have taken to reduce barriers and motivate the freshmen students to deal with the subject by introduction of an e-learning course and further by offering an associated lab course with practical application of cyclic programming of a real-time system in teams. Further we present an adapted architecture how the lab course is enhanced to act as a remote lab Finally we evaluate the impact of the course by measuring the success factors of different gender combined groups and give an outlook on future scenarios for lab courses to improve the learning experience and success of the students for both gender. (C) 2015, IFAC (international Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
The proceedings contain 15 papers. The special focus in this conference is on internationalworkshop and Tutorial, held as part of the World Congress on Formal Methods. The topics include: Principled and Pragmatic Spe...
ISBN:
(纸本)9783030324407
The proceedings contain 15 papers. The special focus in this conference is on internationalworkshop and Tutorial, held as part of the World Congress on Formal Methods. The topics include: Principled and Pragmatic Specification of programming Languages;managing Heterogeneity and Bridging the Gap in Teaching Formal Methods;teaching Introductory Formal Methods and Discrete Mathematics to Software Engineers: Reflections on a Modelling-Focussed Approach;teaching Formal Methods: Lessons Learnt from Using Event-B;you Already Used Formal Methods but Did Not Know It;Teaching Deductive Verification Through Frama-C and SPARK for Non Computer Scientists;using Krakatoa for Teaching Formal Verification of Java Programs;teaching Deductive Verification in Why3 to Undergraduate Students;teaching Formal Methods to Future Engineers;the Computational Relevance of Formal logic Through Formal Proofs;teaching Formal Methods: From Software in the Small to Software in the Large;on Teaching Applied Formal Methods in Aerospace Engineering;teaching Concurrency with the Disappearing Formal Method.
We use metalogic to define a suitable notion of module in logicprogramming. A module is viewed as a pair of logic programs, corresponding to the visible and the hidden part of the module, respectively. The constructi...
详细信息
In spite of the recent improvements in the performance of the solvers based on the DPLL procedure, it is still possible for the search algorithm to focus on the wrong areas of the search space, preventing the solver f...
详细信息
暂无评论