Result 1 to 20 from 275 total
A top-$k$ query answering procedure for fuzzy logic programming. (English)
Fuzzy Sets Syst. 205, 1-29 (2012).
1
Declarative output by ordering text pieces. (English)
Gallagher, John P. (ed.) et al., Technical communications of the 27th international conference on logic programming (ICLP 2011), Lexington, Kentucky, USA, July 6‒10, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-31-6). LIPICS ‒ Leibniz International Proceedings in Informatics 11, 151-161, electronic only (2011).
2
An erotetic logic approach of ontology query. (English)
An. Univ. Craiova, Ser. Mat. Inf. 38, No. 3, 31-36 (2011).
3
Paraconsistent inference from data using existential $Ω$-entailment. (English)
Int. J. Semant. Comput. 5, No. 3 (2011).
4
Consequence and interpolation in Łukasiewicz logic. (English)
Stud. Log. 99, No. 1-3, 269-278 (2011).
5
Algebras for implicative logic with conjunction. (Spanish)
Mat., Enseñ. Univ. (N.S.) 18, No. 2, 31-50 (2010).
6
Natural deduction, hybrid systems and modal logics. (English)
Trends in Logic‒Studia Logica Library 30. Berlin: Springer (ISBN 978-90-481-8784-3/hbk; 978-90-481-8785-0/ebook). xxiii, 491~p. EUR~169.95/net; SFR~244.00; \$~239.00; \sterling~153.00 (2010).
7
Cognitive binary logic ‒ the natural unified formal theory of propositional binary logic. (English)
Grigoriu, Mircea (ed.) et al., Recent advances in computational intelligence. Proceedings of the 4th WSEAS international conference on computational intelligence (CI’10), Bucharest, Romania, April 20‒22, 2010. Athens: World Scientific and Engineering Academy and Society (WSEAS) (ISBN 978-960-474-183-0/CD-ROM; 978-960-474-179-3/hbk). Electrical and Computer Engineering Series. A Series of Reference Books, 135-142 (2010).
8
A framework for satisfiability modulo theories. (English)
Formal Asp. Comput. 21, No. 5, 485-494 (2009).
9
Three and two-valued Łukasiewicz theories in the formal deductive system ${\cal L}^*$ (NM-logic). (English)
Fuzzy Sets Syst. 159, No. 22, 2970-2982 (2008).
10
On the difference between traditional and deductive fuzzy logic. (English)
Fuzzy Sets Syst. 159, No. 10, 1153-1164 (2008).
11
Constructive logic with strong negation is a substructural logic. II. (English)
Stud. Log. 89, No. 3, 401-425 (2008).
12
Structural completeness in substructural logics. (English)
Log. J. IGPL 16, No. 5, 453-495 (2008).
13
A functional spreadsheet framework for authoring logic implication rules. (English)
Bassiliades, Nick (ed.) et al., Rule representation, interchange and reasoning on the web. International symposium, RuleML 2008, Orlando, FL, USA, October 30‒31, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-88807-9/pbk). Lecture Notes in Computer Science 5321, 219-226 (2008).
14
Linear logical algorithms. (English)
Aceto, Luca (ed.) et al., Automata, languages and programming. 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 7‒11, 2008. Proceedings, Part II. Berlin: Springer (ISBN 978-3-540-70582-6/pbk). Lecture Notes in Computer Science 5126, 336-347 (2008).
15
Categorical abstract algebraic logic: Bloom’s theorem for rule-based $π$-institutions. (English)
Log. J. IGPL 16, No. 3, 233-248 (2008).
16
Expressiveness of temporal query languages: On the modelling of intervals, interval relationships and states. (English)
Artif. Intell. Rev. 26, No. 4, 269-289 (2006).
17
Enhancing DLV instantiator by backjumping techniques. (English)
Ann. Math. Artif. Intell. 51, No. 2-4, 195-228 (2007).
18
A temporal dynamic logic for verifying hybrid system invariants. (English)
Artemov, Sergei N. (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2007, New York, NY, USA, June 4‒7, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72732-3/pbk). Lecture Notes in Computer Science 4514, 457-471 (2007).
19
A paraconsistent logic programming approach for querying inconsistent databases. (English)
Int. J. Approx. Reasoning 46, No. 2, 366-386 (2007).
20
Result 1 to 20 from 275 total
Start
Contact
Print
General Help
