Multi-adjoint logic programming with continuous semantics
From MaRDI portal
Recommendations
Cited in
(58)- An improved reductant calculus using fuzzy partial evaluation techniques
- Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
- Adjoint negations, more than residuated negations
- Representation of fuzzy subsets by Galois connections
- Fuzzy logic programming and fuzzy control
- Syntax and semantics of multi-adjoint normal logic programming
- Similarity-based unification: A multi-adjoint approach
- A neural implementation of multi-adjoint logic programming
- Multi-adjoint lattices from adjoint triples with involutive negation
- Extended multi-adjoint logic programming
- Finitary coalgebraic multisemilattices and multilattices.
- On heterogeneous formal contexts
- Termination of logic programs with imperfect information: applications and query procedure
- On fuzzy unfolding: A multi-adjoint approach
- Thresholded semantic framework for a fully integrated fuzzy logic language
- Issues on adjointness in multiple-valued logics
- Qualified logic programming with bivalued predicates
- Efficient reductants calculi using partial evaluation techniques with thresholding
- From fuzzy to annotated semantic web languages
- Beyond multi-adjoint logic programming
- Multi-lattices as a Basis for Generalized Fuzzy Logic Programming
- Modeling Interpretive Steps in Fuzzy Logic Computations
- Multi-adjoint property-oriented and object-oriented concept lattices
- scientific article; zbMATH DE number 2085246 (Why is no real title available?)
- scientific article; zbMATH DE number 2085283 (Why is no real title available?)
- scientific article; zbMATH DE number 2090547 (Why is no real title available?)
- Dedekind–MacNeille completion and Cartesian product of multi-adjoint lattices
- Multi-adjoint relation equations: definition, properties and solutions using concept lattices
- Impact Zadeh's theory to algebraic structures. Multi-adjoint algebras
- Efficient Unfolding of Fuzzy Connectives for Multi-adjoint Logic Programs
- Towards the Use of Hypergraphs in Multi-adjoint Logic Programming
- Minimal solutions of fuzzy relation equations with general operators on the unit interval
- Adjoint Triples and Residuated Aggregators
- Proximity-based unification theory
- Logics in Artificial Intelligence
- A neural implementation of multi-adjoint logic programs via sf-homogenization
- Adding similarity-based reasoning capabilities to a Horn fragment of possibilistic logic with fuzzy constants
- Fuzzy Prolog: A new approach using soft constraints propagation
- Fuzzy logic programs as hypergraphs. Termination results
- Multi-adjoint lattice logic and truth-stressing hedges
- Algebraic structure and characterization of adjoint triples
- A logical characterization of multi-adjoint algebras
- Heterogeneous formal context and its decomposition by heterogeneous fuzzy subsets
- Immediate consequences operator on generalized quantifiers
- On the impact of sup‐compositions in the resolution of multi‐adjoint relation equations
- Characterizing fuzzy y-models in multi-adjoint normal logic programming
- On the Exchange Principle in Adjoint Triples
- Hypergraphs in logic programming
- Fuzzy data exchange
- Constraint heterogeneous concept lattices and concept lattices with heterogeneous hedges
- Counting semicopulas on finite structures
- Stratified extended multi-adjoint logic programming
- A top-\(k\) query answering procedure for fuzzy logic programming
- Computational reaching of quantified consequences from imperfect initial data
- Hypergraph logic program representation versus stratified programs
- Fuzzy logic programming via multilattices
- Tabulation proof procedures for fuzzy linguistic logic programming
- Multi-adjoint algebras versus non-commutative residuated structures
This page was built for publication: Multi-adjoint logic programming with continuous semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4798020)
