
-
Strong Equivalence for LPMLN Programs
LPMLN is a probabilistic extension of answer set programs with the weigh...
read it
-
Bridging Commonsense Reasoning and Probabilistic Planning via a Probabilistic Action Language
To be responsive to dynamically changing real-world environments, an int...
read it
-
Explainable Fact Checking with Probabilistic Answer Set Programming
One challenge in fact checking is the ability to improve the transparenc...
read it
-
Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language pBC+
We extend probabilistic action language pBC+ with the notion of utility ...
read it
-
Fully Convolutional Network-based Multi-Task Learning for Rectum and Rectal Cancer Segmentation
In this study, we present a fully automatic method to segment both rectu...
read it
-
Multi-Task Learning with a Fully Convolutional Network for Rectum and Rectal Cancer Segmentation
In a rectal cancer treatment planning, the location of rectum and rectal...
read it
-
Weight Learning in a Probabilistic Extension of Answer Set Programs
LPMLN is a probabilistic extension of answer set programs with the weigh...
read it
-
Translating LPOD and CR-Prolog2 into Standard Answer Set Programs
Logic Programs with Ordered Disjunction (LPOD) is an extension of standa...
read it
-
A Probabilistic Extension of Action Language BC+
We present a probabilistic extension of action language BC+. Just like B...
read it
-
Representing Hybrid Automata by Action Language Modulo Theories
Both hybrid automata and action languages are formalisms for describing ...
read it
-
Computing LPMLN Using ASP and MLN Solvers
LPMLN is a recent addition to probabilistic logic programming languages....
read it
-
On the Semantic Relationship between Probabilistic Soft Logic and Markov Logic
Markov Logic Networks (MLN) and Probabilistic Soft Logic (PSL) are widel...
read it
-
Reformulating the Situation Calculus and the Event Calculus in the General Theory of Stable Models and in Answer Set Programming
Circumscription and logic programs under the stable model semantics are ...
read it
-
First-Order Stable Model Semantics and First-Order Loop Formulas
Lin and Zhaos theorem on loop formulas states that in the propositional ...
read it
-
A Functional View of Strong Negation in Answer Set Programming
The distinction between strong negation and default negation has been us...
read it
-
Two New Definitions of Stable Models of Logic Programs with Generalized Quantifiers
We present alternative definitions of the first-order stable model seman...
read it
-
Module Theorem for The General Theory of Stable Models
The module theorem by Janhunen et al. demonstrates how to provide a modu...
read it
-
Representing First-Order Causal Theories by Logic Programs
Nonmonotonic causal logic, introduced by Norman McCain and Hudson Turner...
read it
-
On Elementary Loops of Logic Programs
Using the notion of an elementary loop, Gebser and Schaub refined the th...
read it