SOTAVerified

Negation

Papers

Showing 451–475 of 608 papers

TitleStatusHype
New Distinguishers for Negation-Limited Weak Pseudorandom Functions—0
No means ‘No’; a non-im-proper modeling approach, with embedded speculative context—0
Non Deterministic Logic Programs—0
NoT: Federated Unlearning via Weight Negation—0
``Not not bad'' is not ``bad'': A distributional account of negation—0
"Not not bad" is not "bad": A distributional account of negation—0
On Fairness of Task Arithmetic: The Role of Task Vectors—0
On resolving conflicts between arguments—0
On Strong and Default Negation in Logic Program Updates (Extended Version)—0
On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits—0
On the Computation of Paracoherent Answer Sets—0
On the Correspondence of Non-flat Assumption-based Argumentation and Logic Programming with Negation as Failure in the Head—0
On the Logical Content of Logic Programs—0
On the negation of a Dempster-Shafer belief structure based on maximum uncertainty allocation—0
On the Number of Control Nodes in Boolean Networks with Degree Constraints—0
On the read-once property of branching programs and CNFs of bounded treewidth—0
On the relation between structured d-DNNFs and SDDs—0
Ontology-based Data Access: A Study through Disjunctive Datalog, CSP, and MMSNP—0
On Uniform Equivalence of Epistemic Logic Programs—0
Opinion mining of movie reviews at document level—0
Ordered Functional Decision Diagrams: A Functional Semantics For Binary Decision Diagrams—0
Order-sensitive Shapley Values for Evaluating Conceptual Soundness of NLP Models—0
Orthogonal Attention: A Cloze-Style Approach to Negation Scope Resolution—0
Overlooked Data in Typological Databases: What Grambank Teaches Us About Gaps in Grammars—0
Parameterized Compilation Lower Bounds for Restricted CNF-formulas—0
Show:102550
← PrevPage 19 of 25Next →

No leaderboard results yet.