Suchergebnisse - Logic programming and answer set programming

An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems von Dovier, Agostino, Formisano, Andrea, Pontelli, Enrico

“… This paper presents experimental comparisons between the declarative encodings of various computationally hard problems in Answer Set Programming (ASP …”
Volltext

Finite-Choice Logic Programming von Martens, Chris, Simmons, Robert J., Arntzenius, Michael

“… —there is no single canonical model. The notion of stable models for logic programs with negation has successfully captured programmer intuition about the set of valid solutions for such problems, giving rise to a family of programming …”
Volltext

Alignment Completeness for Relational Hoare Logics von Nagasamudram, Ramana, Naumann, David A.

“… Relational Hoare logics (RHL) provide rules for reasoning about relations between programs …”
Volltext

Inductive Synthesis of Inductive Heap Predicates von Yang, Ziyi, Sergey, Ilya

“… ) from concrete data structure instances using Inductive Logic Programming (ILP) techniques. The main challenges to make such synthesis effective are (1 …”
Volltext

From SMT to ASP: Solver-Based Approaches to Solving Datalog Synthesis-as-Rule-Selection Problems von Bembenek, Aaron, Greenberg, Michael, Chong, Stephen

“… —an encoding into standard, off-the-shelf answer set programming (ASP)—leads to significant speedups (∼ 9× geomean …”
Volltext

Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable Fragments von Jung, Jean Christoph, Wolter, Frank

“… In logics with the Craig interpolation property (CIP) the existence of an interpolant for an implication follows from the validity of the implication …”
Volltext

Declarative Logic Programming: Theory, Systems, and Applications von Michael, Kifer, Liu, Yanhong

“… Logic Programming (LP) is at the nexus of knowledge representation, AI, mathematical logic, databases, and programming languages …”
Volltext

Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes von Dreier, Jan

“… Most notably, every problem definable in first-order logic can be solved in linear time on bounded expansion graph classes …”
Volltext

Compositional relational reasoning via operational game semantics von Jaber, Guilhem, Murawski, Andrzej S.

“… We show how to use operational game semantics as a guide to develop relational techniques for establishing contextual equivalences with respect to contexts …”
Volltext

Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses von Burn, Toby Cathcart, Ong, Luke, Ramsay, Steven, Wagner, Dominik

“… The class may be viewed as a generalisation to higher-order logic (with a simple restriction on types …”
Volltext

Gödel-McKinsey-Tarski and Blok-Esakia for Heyting-Lewis Implication von de Groot, Jim, Litak, Tadeusz, Pattinson, Dirk

“… Heyting-Lewis Logic is the extension of intuitionistic propositional logic with a strict implication connective that satisfies the constructive counterparts of axioms for strict implication provable …”
Volltext

Inapproximability of Unique Games in Fixed-Point Logic with Counting von Tucker-Foltz, Jamie

“… We study the extent to which it is possible to approximate the optimal value of a Unique Games instance in Fixed-Point Logic with Counting (FPC …”
Volltext

A Constructive Logic with Classical Proofs and Refutations von Barenbaum, Pablo, Freund, Teodoro

“… We study a conservative extension of classical propositional logic distinguishing between four modes of statement …”
Volltext

Removing Redundant Refusals: Minimal Complete Test Suites for Failure Trace Semantics von Gazda, Maciej, Hierons, Robert M.

“… at most ℓ.The proposed approach is based on generating a minimal complete set of forbidden refusal traces …”
Volltext

Abstract Argumentation and Answer Set Programming: Two Faces of Nelson’s Logic von FANDINNO, JORGE, FARIÑAS DEL CERRO, LUIS

“… In this work, we show that both logic programming and abstract argumentation frameworks can be interpreted in terms …”
Volltext

A rule-based ontological framework for the classification of molecules von Magka, Despoina, Krötzsch, Markus, Horrocks, Ian

“… Background A variety of key activities within life sciences research involves integrating and intelligently managing large amounts of biochemical information …”
Volltext

Modal Logic S5 Satisfiability in Answer Set Programming von ALVIANO, MARIO, BATSAKIS, SOTIRIS, BARYANNIS, GEORGE

“… In this work, we propose to use Answer Set Programming for implementing such constructions, and in particular for identifying the propositional atoms …”
Volltext

Logic-Based Benders Decomposition in Answer Set Programming for Chronic Outpatients Scheduling von CAPPANERA, PAOLA, GAVANELLI, MARCO, NONATO, MADDALENA, ROMA, MARCO

“… In answer set programming (ASP), the user can define declaratively a problem and solve it with efficient solvers …”
Volltext

Combining answer set programming with description logics for the Semantic Web von Eiter, Thomas, Ianni, Giovambattista, Lukasiewicz, Thomas, Schindlauer, Roman, Tompits, Hans

“… We propose a combination of logic programming under the answer set semantics with the description logics SHIF ( D ) and SHOIN ( D …”
Volltext

Feedback Turing Computability, and Turing Computability as Feedback von Ackerman, Nathanael L., Freer, Cameron E., Lubarsky, Robert S.

“… The notion of a feedback query is a natural generalization of choosing for an oracle the set of indices of halting computations …”
Volltext