Search Results for author:
Found 4 papers, 0 papers with code
On Loop Formulas with Variables
Recently Ferraris, Lee and Lifschitz proposed a new definition of stable models that does not refer to grounding, which applies to the syntax of arbitrary first-order sentences.
Are Interpretations Fairly Evaluated? A Definition Driven Pipeline for Post-Hoc Interpretability
Recent years have witnessed an increasing number of interpretation methods being developed for improving transparency of NLP models.
Representing Hybrid Automata by Action Language Modulo Theories
We first show how to represent linear hybrid automata with convex invariants by an action language modulo theories.
First-Order Stable Model Semantics and First-Order Loop Formulas
Lin and Zhaos theorem on loop formulas states that in the propositional case the stable model semantics of a logic program can be completely characterized by propositional loop formulas, but this result does not fully carry over to the first-order case.
