Cover Image

Intensional FOL over Belnap's Billatice for Strong-AI Robotics

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Majkic, Zoran
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Neuro-Symbolic Strong-AI Robots with Closed Knowledge Assumption: Learning and Deductions
by: Majkic, Zoran
Published: (2026)

Intensional FOL: Many-Sorted Extension
by: Majkic, Zoran
Published: (2024)

Groupoidal Realizability for Intensional Type Theory
by: Speight, Sam
Published: (2024)

SCL(FOL) Revisited
by: Bromberger, Martin, et al.
Published: (2023)

Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong Equivalence
by: Fandinno, Jorge, et al.
Published: (2024)

Efficiently grounding FOL using bit vectors
by: Van Laer, Lucas, et al.
Published: (2024)

Four imprints of Belnap's useful four-valued logic in computer science
by: Jakl, Tomáš
Published: (2025)

The interdefinability of expansions of Belnap-Dunn logic
by: Middelburg, C. A.
Published: (2024)

Order-Sorted Intensional Logic: Expressing Subtyping Polymorphism with Typing Assertions and Quantification over Concepts
by: Marković, Đorđe, et al.
Published: (2025)

Splitting Answer Set Programs with respect to Intensionality Statements (Extended Version)
by: Fandinno, Jorge, et al.
Published: (2025)

Trillium: Higher-Order Concurrent and Distributed Separation Logic for Intensional Refinement
by: Timany, Amin, et al.
Published: (2021)

On an ordinary expansion of first-order Belnap-Dunn logic
by: Middelburg, C. A.
Published: (2023)

Do LLMs Really Struggle at NL-FOL Translation? Revealing their Strengths via a Novel Benchmarking Strategy
by: Brunello, Andrea, et al.
Published: (2025)

Strong negation in the theory of computable functionals TCF
by: Köpp, Nils, et al.
Published: (2022)

Effective Versions of Strong Measure Zero
by: Rayman, Matthew
Published: (2025)

Two-layered logics for probabilities and belief functions over Belnap--Dunn logic
by: Bilkova, Marta, et al.
Published: (2024)

On matrix rank function over bounded arithmetics
by: Ken, Eitetsu, et al.
Published: (2023)

Belnap-Dunn logic and query answering in inconsistent databases with null values
by: Middelburg, C. A.
Published: (2023)

Abstract computation over first-order structures. Part IIa: Moschovakis' operator and other non-determinisms
by: Gaßner, Christine
Published: (2025)

Abstract computation over first-order structures. Part IIb: Moschovakis' operator and other non-determinisms
by: Gaßner, Christine
Published: (2025)

Abstract computation over first-order structures. Part I: Deterministic and non-deterministic BSS RAMs
by: Gaßner, Christine
Published: (2025)

Strong Faithfulness for ELH Ontology Embeddings
by: Lacerda, Victor, et al.
Published: (2023)

Strong Nominal Semantics for Fixed-Point Constraints
by: Caires-Santos, Ali K., et al.
Published: (2024)

A Strong Bisimulation for a Classical Term Calculus
by: Bonelli, Eduardo, et al.
Published: (2021)

Equilibrium Semantics and Strong Equivalence for Higher-Order Logic Programs
by: Charalambidis, Angelos, et al.
Published: (2026)

Many-valued coalgebraic logic over semi-primal varieties
by: Kurz, Alexander, et al.
Published: (2023)

Strong normalization through idempotent intersection types: a new syntactical approach
by: Barenbaum, Pablo, et al.
Published: (2025)

A Strongly Normalising System of Dependent Types for Transparent and Opaque Probabilistic Computation
by: Genco, Francesco A.
Published: (2024)

Codd's Theorem for Databases over Semirings
by: Badia, Guillermo, et al.
Published: (2025)

Regular expressions over countable words
by: Colcombet, Thomas, et al.
Published: (2025)

Implication Problems over Positive Semirings
by: Hirvonen, Minna
Published: (2025)

Algebraic Reasoning over Relational Structures
by: Jurka, Jan, et al.
Published: (2024)

Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2025)

How (and when) can you fit examples to logic-based hypothesis classes over infinite structures?
by: Benedikt, Michael, et al.
Published: (2026)

Decidability of MSO Reparameterization over Countable Chains
by: Rabinovich, Alexander
Published: (2026)

Equational Theorem Proving for Clauses over Strings
by: Kim, Dohan
Published: (2023)

One-Dimensional Fragment over Words and Trees
by: Kieronski, Emanuel, et al.
Published: (2021)

The Church Synthesis Problem over Continuous Time
by: Rabinovich, Alexander, et al.
Published: (2024)

Modular Counting over 3-Element and Conservative Domains
by: Bulatov, Andrei A., et al.
Published: (2025)

Observation algebras: Heyting algebra over coherence spaces
by: Brunet, Paul
Published: (2025)