Institut für Informatik und Computational Science
Refine
Year of publication
- 2020 (22) (remove)
Document Type
- Article (22) (remove)
Is part of the Bibliography
- yes (22)
Keywords
- Answer Set Programming (2)
- E-Learning (2)
- Fault tolerance (2)
- IT-Infrastruktur (2)
- answer set programming (2)
- Android hybrid apps (1)
- Conformant Planning (1)
- DMR (1)
- DNA hairpin formation (1)
- Digitale Medien (1)
- Digitalisierung (1)
- Double cell upsets (DCUs) (1)
- E-Assessment (1)
- E-Klausuren (1)
- E-Portfolio (1)
- EDC (1)
- Elektronisches Prüfen (1)
- Epistemic Logic Programs (1)
- FEDC (1)
- Fault tolerant systems (1)
- Forschungsdatenmanagement (1)
- Hairpin completions (1)
- Hairpin reductions (1)
- Innovation (1)
- Internet of Things (1)
- Lindenmayer systems (1)
- MQTT (1)
- Mobile App (1)
- Non-Monotonic (1)
- Partizipation (1)
- Persönliche Lernumgebung (1)
- Reasoning (1)
- Semilinearity property (1)
- Strategie (1)
- TMR (1)
- Triple modular redundancy (TMR) (1)
- UX (1)
- acyclicity properties (1)
- arousal (1)
- asynchrounous design (1)
- autism (1)
- bibliometric analysis (1)
- bundled data (1)
- circuit Faults (1)
- citation analysis (1)
- click controller (1)
- clocks (1)
- co-citation analysis (1)
- co-occurrence analysis (1)
- coherence relation (1)
- combinatorial optimization problems (1)
- competition (1)
- concession (1)
- concurrent checking (1)
- connective (1)
- context-free grammar (1)
- context-sensitive (1)
- contrast (1)
- corpus analysis (1)
- degree of non-context-freeness (1)
- degree of non-regularity (1)
- determinism (1)
- developmental systems (1)
- edge computing (1)
- emission factor (1)
- ensemble methods (1)
- face tracking (1)
- facial expression (1)
- firmware update (1)
- formal languages (1)
- gradient boosting (1)
- grammar (1)
- greenhouse gas (1)
- information flow control (1)
- latches (1)
- logic-based modeling (1)
- measure development (1)
- neural networks (1)
- on-farm evaluation (1)
- parallel rewriting (1)
- parity aggregate operator (1)
- perception (1)
- perception differences (1)
- random forest (1)
- regression (1)
- restricted parallelism (1)
- satisfiability (1)
- security (1)
- self-checking (1)
- soft errors (1)
- static analysis (1)
- support vector machines (1)
- timing (1)
- transient Faults (1)
- transient analysis (1)
- user experience (1)
This paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories. We extend the definition of program completion to programs with input and output in a subset of the input language of the ASP grounder gringo, study the relationship between stable models and completion in this context, and describe preliminary experiments with the use of two software tools, anthem and vampire, for verifying the correctness of programs with input and output. Proofs of theorems are based on a lemma that relates the semantics of programs studied in this paper to stable models of first-order formulas.
Eclingo
(2020)
We describe eclingo, a solver for epistemic logic programs under Gelfond 1991 semantics built upon the Answer Set Programming system clingo. The input language of eclingo uses the syntax extension capabilities of clingo to define subjective literals that, as usual in epistemic logic programs, allow for checking the truth of a regular literal in all or in some of the answer sets of a program. The eclingo solving process follows a guess and check strategy. It first generates potential truth values for subjective literals and, in a second step, it checks the obtained result with respect to the cautious and brave consequences of the program. This process is implemented using the multi-shot functionalities of clingo. We have also implemented some optimisations, aiming at reducing the search space and, therefore, increasing eclingo 's efficiency in some scenarios. Finally, we compare the efficiency of eclingo with two state-of-the-art solvers for epistemic logic programs on a pair of benchmark scenarios and show that eclingo generally outperforms their obtained results.