2019
DOI: 10.1007/978-3-030-16469-0_16
|View full text |Cite
|
Sign up to set email alerts
|

Cellular Transport Systems Improved: Achieving Efficient Operations with Answer Set Programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 20 publications
0
0
0
Order By: Relevance
“…Answer set programming (ASP, (Baral 2010;Gelfond and Lifschitz 1988;Gelfond 2008)) is a well-established knowledge representation and reasoning (KR) formalism which has found its way into many application domains (Takeuchi et al 2023;Abels et al 2021;Gebser et al 2018;Schieweck, Kern-Isberner, and ten Hompel 2017). As a most important feature of ASP, default negation (Clark 1977) allows for reasoning with rules such as "B ← A, not C." stating that if A holds, then B follows unless C is proven to be true, even if specific information on the default-negated literal C is not available.…”
Section: Introductionmentioning
confidence: 99%
“…Answer set programming (ASP, (Baral 2010;Gelfond and Lifschitz 1988;Gelfond 2008)) is a well-established knowledge representation and reasoning (KR) formalism which has found its way into many application domains (Takeuchi et al 2023;Abels et al 2021;Gebser et al 2018;Schieweck, Kern-Isberner, and ten Hompel 2017). As a most important feature of ASP, default negation (Clark 1977) allows for reasoning with rules such as "B ← A, not C." stating that if A holds, then B follows unless C is proven to be true, even if specific information on the default-negated literal C is not available.…”
Section: Introductionmentioning
confidence: 99%