Výsledky vyhledávání - "Logic programming and answer set programming"
-
1
An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems
ISSN: 0952-813X, 1362-3079Vydáno: Abingdon Taylor & Francis Group 01.06.2009Vydáno v Journal of experimental & theoretical artificial intelligence (01.06.2009)“…This paper presents experimental comparisons between the declarative encodings of various computationally hard problems in Answer Set Programming (ASP) and…”
Získat plný text
Journal Article -
2
Inductive Synthesis of Inductive Heap Predicates
ISSN: 2475-1421, 2475-1421Vydáno: New York, NY, USA ACM 09.04.2025Vydáno v Proceedings of ACM on programming languages (09.04.2025)“…We present an approach to automatically synthesise recursive predicates in Separation Logic (SL) from concrete data structure instances using Inductive Logic…”
Získat plný text
Journal Article -
3
Finite-Choice Logic Programming
ISSN: 2475-1421, 2475-1421Vydáno: New York, NY, USA ACM 07.01.2025Vydáno v Proceedings of ACM on programming languages (07.01.2025)“…Logic programming, as exemplified by datalog, defines the meaning of a program as its unique smallest model: the deductive closure of its inference rules…”
Získat plný text
Journal Article -
4
From SMT to ASP: Solver-Based Approaches to Solving Datalog Synthesis-as-Rule-Selection Problems
ISSN: 2475-1421, 2475-1421Vydáno: New York, NY, USA ACM 09.01.2023Vydáno v Proceedings of ACM on programming languages (09.01.2023)“…Given a set of candidate Datalog rules, the Datalog synthesis-as-rule-selection problem chooses a subset of these rules that satisfies a specification (such as…”
Získat plný text
Journal Article -
5
Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable Fragments
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…In logics with the Craig interpolation property (CIP) the existence of an interpolant for an implication follows from the validity of the implication. In…”
Získat plný text
Konferenční příspěvek -
6
Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…The concept of bounded expansion provides a robust way to capture sparse graph classes with interesting algorithmic properties. Most notably, every problem…”
Získat plný text
Konferenční příspěvek -
7
Alignment Completeness for Relational Hoare Logics
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…Relational Hoare logics (RHL) provide rules for reasoning about relations between programs. Several RHLs include a rule we call sequential product that infers…”
Získat plný text
Konferenční příspěvek -
8
Gödel-McKinsey-Tarski and Blok-Esakia for Heyting-Lewis Implication
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…Heyting-Lewis Logic is the extension of intuitionistic propositional logic with a strict implication connective that satisfies the constructive counterparts of…”
Získat plný text
Konferenční příspěvek -
9
Compositional relational reasoning via operational game semantics
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…We show how to use operational game semantics as a guide to develop relational techniques for establishing contextual equivalences with respect to contexts…”
Získat plný text
Konferenční příspěvek -
10
Removing Redundant Refusals: Minimal Complete Test Suites for Failure Trace Semantics
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…We explore the problem of finding a minimal complete test suite for a refusal trace (or failure trace) semantics. Since complete test suites are typically…”
Získat plný text
Konferenční příspěvek -
11
Inapproximability of Unique Games in Fixed-Point Logic with Counting
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…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). We prove two…”
Získat plný text
Konferenční příspěvek -
12
A Constructive Logic with Classical Proofs and Refutations
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…We study a conservative extension of classical propositional logic distinguishing between four modes of statement: a proposition may be affirmed or denied, and…”
Získat plný text
Konferenční příspěvek -
13
Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…We present initial limit Datalog, a new extensible class of constrained Horn clauses for which the satisfiability problem is decidable. The class may be viewed…”
Získat plný text
Konferenční příspěvek -
14
Declarative Logic Programming: Theory, Systems, and Applications
ISBN: 1970001968, 9781970001969Vydáno: San Rafael Association for Computing Machinery 2018“…Logic Programming (LP) is at the nexus of knowledge representation, AI, mathematical logic, databases, and programming languages. It allows programming to be…”
Získat plný text
E-kniha -
15
A rule-based ontological framework for the classification of molecules
ISSN: 2041-1480, 2041-1480Vydáno: London BioMed Central 15.04.2014Vydáno v Journal of biomedical semantics (15.04.2014)“…Background A variety of key activities within life sciences research involves integrating and intelligently managing large amounts of biochemical information…”
Získat plný text
Journal Article -
16
Feedback Turing Computability, and Turing Computability as Feedback
ISSN: 1043-6871Vydáno: IEEE 01.07.2015Vydáno v 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (01.07.2015)“…The notion of a feedback query is a natural generalization of choosing for an oracle the set of indices of halting computations. Notice that, in that setting,…”
Získat plný text
Konferenční příspěvek -
17
Software engineering approach in the design and development of the industrial automation systems
ISBN: 1605580767, 9781605580760ISSN: 0270-5257Vydáno: 13.05.2008Vydáno v International Conference on Software Engineering 2008 (13.05.2008)“…The objective of the paper is to present generalized approach in design and development of industrial automation systems based on software engineering…”
Získat plný text
Journal Article -
18
Crowdsourced Linked Data Question Answering with AQUACOLD
Vydáno: IEEE 01.09.2021Vydáno v 2021 ACM/IEEE Joint Conference on Digital Libraries (JCDL) (01.09.2021)“…There is a need for Question Answering (QA) to return accurate answers to complex natural language questions over Linked Data, improving the accessibility of…”
Získat plný text
Konferenční příspěvek -
19
Citations for the Test-of-Time Award from 2001
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…Two awards were made in 2021 to honour outstanding papers from the IEEE Symposium On Logic In Computer Science 2001 held in Boston, MA, USA. The awards went to…”
Získat plný text
Konferenční příspěvek -
20
DeepTelos Demonstration
ISBN: 9781728151250, 1728151260, 9781728151267, 1728151252Vydáno: IEEE 01.09.2019Vydáno v 2019 ACM IEEE 22nd International Conference on Model Driven Engineering Languages and Systems Companion (MODELS C) (01.09.2019)“…DeepTelos is defined as a set of rules and constraints that enable multi-level modeling for the Telos metamodeling language. In its ConceptBase implementation,…”
Získat plný text
Konferenční příspěvek

