464,490 research outputs found
Knowledge Compilation of Logic Programs Using Approximation Fixpoint Theory
To appear in Theory and Practice of Logic Programming (TPLP), Proceedings of
ICLP 2015
Recent advances in knowledge compilation introduced techniques to compile
\emph{positive} logic programs into propositional logic, essentially exploiting
the constructive nature of the least fixpoint computation. This approach has
several advantages over existing approaches: it maintains logical equivalence,
does not require (expensive) loop-breaking preprocessing or the introduction of
auxiliary variables, and significantly outperforms existing algorithms.
Unfortunately, this technique is limited to \emph{negation-free} programs. In
this paper, we show how to extend it to general logic programs under the
well-founded semantics.
We develop our work in approximation fixpoint theory, an algebraical
framework that unifies semantics of different logics. As such, our algebraical
results are also applicable to autoepistemic logic, default logic and abstract
dialectical frameworks
Pointwise intersection in neighbourhood modal logic
We study the logic of neighbourhood models with pointwise intersection, as a
means to characterize multi-modal logics. Pointwise intersection takes us from
a set of neighbourhood sets (one for each member of a set
, used to interpret the modality ) to a new neighbourhood set
, which in turn allows us to interpret the operator .
Here, is in the neighbourhood for if and only if equals the
intersection of some . We show that the
notion of pointwise intersection has various applications in epistemic and
doxastic logic, deontic logic, coalition logic, and evidence logic. We then
establish sound and strongly complete axiomatizations for the weakest logic
characterized by pointwise intersection and for a number of variants, using a
new and generally applicable technique for canonical model construction.Comment: Submitted to Advances in Modal Logic 201
On the complexity of the closed fragment of Japaridze's provability logic
We consider well-known provability logic GLP. We prove that the
GLP-provability problem for variable-free polymodal formulas is
PSPACE-complete. For a number n, let L^n_0 denote the class of all polymodal
variable-free formulas without modalities , ,... . We show that, for
every number n, the GLP-provability problem for formulas from L^n_0 is in
PTIME.Comment: 12 pages, the results of this work and a proof sketch are in Advances
in Modal Logic 2012 extended abstract on the same nam
One-count memory circuit prevents machine mode interaction
One-count memory logic circuit used with electromechanical counter-printer machines operates in either count or print mode. The circuit advances the counter when the machine is in the count mode and provides storage for the count pulse when the machine is in the print mode
Geometric Aspects of Multiagent Systems
Recent advances in Multiagent Systems (MAS) and Epistemic Logic within
Distributed Systems Theory, have used various combinatorial structures that
model both the geometry of the systems and the Kripke model structure of models
for the logic. Examining one of the simpler versions of these models,
interpreted systems, and the related Kripke semantics of the logic (an
epistemic logic with -agents), the similarities with the geometric /
homotopy theoretic structure of groupoid atlases is striking. These latter
objects arise in problems within algebraic K-theory, an area of algebra linked
to the study of decomposition and normal form theorems in linear algebra. They
have a natural well structured notion of path and constructions of path
objects, etc., that yield a rich homotopy theory.Comment: 14 pages, 1 eps figure, prepared for GETCO200
A Sound and Complete Axiomatization of Majority-n Logic
Manipulating logic functions via majority operators recently drew the
attention of researchers in computer science. For example, circuit optimization
based on majority operators enables superior results as compared to traditional
logic systems. Also, the Boolean satisfiability problem finds new solving
approaches when described in terms of majority decisions. To support computer
logic applications based on majority a sound and complete set of axioms is
required. Most of the recent advances in majority logic deal only with ternary
majority (MAJ- 3) operators because the axiomatization with solely MAJ-3 and
complementation operators is well understood. However, it is of interest
extending such axiomatization to n-ary majority operators (MAJ-n) from both the
theoretical and practical perspective. In this work, we address this issue by
introducing a sound and complete axiomatization of MAJ-n logic. Our
axiomatization naturally includes existing majority logic systems. Based on
this general set of axioms, computer applications can now fully exploit the
expressive power of majority logic.Comment: Accepted by the IEEE Transactions on Computer
Design Automation and Design Space Exploration for Quantum Computers
A major hurdle to the deployment of quantum linear systems algorithms and
recent quantum simulation algorithms lies in the difficulty to find inexpensive
reversible circuits for arithmetic using existing hand coded methods. Motivated
by recent advances in reversible logic synthesis, we synthesize arithmetic
circuits using classical design automation flows and tools. The combination of
classical and reversible logic synthesis enables the automatic design of large
components in reversible logic starting from well-known hardware description
languages such as Verilog. As a prototype example for our approach we
automatically generate high quality networks for the reciprocal , which is
necessary for quantum linear systems algorithms.Comment: 6 pages, 1 figure, in 2017 Design, Automation & Test in Europe
Conference & Exhibition, DATE 2017, Lausanne, Switzerland, March 27-31, 201
Putting theory oriented evaluation into practice
Evaluations of gaming simulations and business games as teaching devices are typically end-state driven. This emphasis fails to detect how the simulation being evaluated does or does not bring about its desired consequences. This paper advances the use of a logic model approach which possesses a holistic perspective that aims at including all elements associated with the situation created by a game. The use of the logic model approach is illustrated as applied to Simgame, a board game created for secondary school level business education in six European Union countries
- …